Name
Abstract | ||
|---|---|---|
The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an F-q-linear rank-metric code over F-q(m) (x) (n) of rate R = (1 - rho) (1 - n/m rho) - epsilon is shown to be (with high probability) list-decodable up to fractional radius rho is an element of(0,1) with lists of size at most C-rho,C-q/epsilon, where C-rho,C-q is a constant depending only on rho and q. This matches the bound for random rank-metric codes (up to constant factors). The proof adapts the approach of Guruswami, Hastad, Kopparty (STOC 2010), who established a similar result for the Hamming metric case, to the rank-metric setting. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/isit.2018.8437698 | 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
DocType | Volume | Citations |
Conference | abs/1710.11516 | 2 |
PageRank | References | Authors |
0.38 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Guruswami | 1 | 3205 | 247.96 |
| Nicolas Resch | 2 | 4 | 2.80 |