Name
Abstract | ||
|---|---|---|
We construct an explicit family of Fh-linear rankmetric codes over any field Fh that enables efficient list-decoding up to a fraction p of errors in the rank metric with a rate of 1 - ρ - e, for any desired ρ ∈ (0, 1) and e > 0. This is the first explicit construction of positive rate rank-metric codes for efficient list-decoding beyond the unique decoding radius. Our codes are explicit subcodes o... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2016.2544347 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Decoding,Reed-Solomon codes,Error analysis,Measurement,Network coding,Space-time codes,Context | Discrete mathematics,Hamming code,Combinatorics,Concatenated error correction code,Group code,Block code,Expander code,Reed–Muller code,Linear code,List decoding,Mathematics | Journal |
Volume | Issue | ISSN |
62 | 5 | 0018-9448 |
Citations | PageRank | References |
5 | 0.44 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Guruswami | 1 | 3205 | 247.96 |
| Carol Wang | 2 | 28 | 4.19 |
| Chaoping Xing | 3 | 916 | 110.47 |