Name
Abstract | ||
|---|---|---|
We investigate the list decodability of symbol-pair codes
<xref ref-type="fn" rid="fn1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><sup>1</sup></xref>
in this paper. First, we show that the list decodability of every symbol-pair code does not exceed the Gilbert–Varshamov bound. On the other hand, we are able to prove that with high probability, a random symbol-pair code can be list decoded up to the Gilbert–Varshamov bound. Our second result of this paper is to derive the Johnson-type bound, i.e., a lower bound on list decoding radius in terms of minimum distance. Finally, we present a list decoding algorithm of Reed–Solomon codes beyond the Johnson-type bound in the pair metric.
<fn id="fn1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><label><sup>1</sup></label><p>A symbol-pair code is referred to a code in the pair metric.</p></fn> |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2019.2904998 | IEEE Trans. Information Theory |
Keywords | Field | DocType |
Decoding,Measurement,Upper bound,Reed-Solomon codes,Indexes,Encoding,Hamming distance | Discrete mathematics,Combinatorics,Upper and lower bounds,Symbol,Computer science,Block code,Hamming distance,Decoding methods,List decoding,Code (cryptography),Encoding (memory) | Journal |
Volume | Issue | ISSN |
abs/1806.08992 | 8 | 0018-9448 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu Liu | 1 | 134 | 18.46 |
| Chaoping Xing | 2 | 916 | 110.47 |
| Chen Yuan | 3 | 27 | 12.30 |