On the List-Decodability of Random Linear Rank-Metric Codes

31 Oct 2017 Guruswami Venkatesan Resch Nicolas

The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R = (1-\rho)(1-\frac{n}{m}\rho)-\varepsilon$ is shown to be (with high probability) list-decodable up to fractional radius $\rho \in (0,1)$ with lists of size at most $\frac{C_{\rho,q}}{\varepsilon}$, where $C_{\rho,q}$ is a constant depending only on $\rho$ and $q$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY

Datasets


  Add Datasets introduced or used in this paper