Name
Abstract | ||
|---|---|---|
Efficient list decoding of rank-metric codes seems more difficult compared with classical block codes although list decodability of random rank-metric codes is completely determined by Ding. For example, it was shown by Raviv and Wachter-Zeh that the list decoding radius of Gabidulin codes is the same as the unique decoding radius, i.e., half the minimum distance for some instances of parameters. On the other hand, Guruswami and Xing give an explicit construction of subcodes of Gabidulin codes, which can be list decoded up to the Singleton bound. This implies that subcodes of Gabidulin codes are good candidates for list decoding. In this paper, we confirm that, with overwhelming probability, a random subcode of a Gabidulin code can be list decoded with decoding radius far beyond half of the minimum distance. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TIT.2016.2628404 | IEEE Trans. Information Theory |
Keywords | Field | DocType |
Decoding,Block codes,Measurement,Upper bound,Manganese,Reed-Solomon codes | Discrete mathematics,Combinatorics,Concatenated error correction code,Sequential decoding,Upper and lower bounds,Computer science,Block code,Linear code,Decoding methods,List decoding,Singleton bound | Journal |
Volume | Issue | ISSN |
63 | 1 | 0018-9448 |
Citations | PageRank | References |
2 | 0.41 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu Liu | 1 | 134 | 18.46 |
| Chaoping Xing | 2 | 916 | 110.47 |
| Chen Yuan | 3 | 27 | 12.30 |