Log In Sign Up

On the list decodability of rank-metric codes containing Gabidulin codes

by   Paolo Santonastaso, et al.

Wachter-Zeh in [42], and later together with Raviv [31], proved that Gabidulin codes cannot be efficiently list decoded for any radius τ, providing that τ is large enough. Also, they proved that there are infinitely many choices of the parameters for which Gabidulin codes cannot be efficiently list decoded at all. Subsequently, in [41] these results have been extended to the family of generalized Gabidulin codes and to further family of MRD-codes. In this paper, we provide bounds on the list size of rank-metric codes containing generalized Gabidulin codes in order to determine whether or not a polynomial-time list decoding algorithm exists. We detect several families of rank-metric codes containing a generalized Gabidulin code as subcode which cannot be efficiently list decoded for any radius large enough and families of rank-metric codes which cannot be efficiently list decoded. These results suggest that rank-metric codes which are 𝔽_q^m-linear or that contains a (power of) generalized Gabidulin code cannot be efficiently list decoded for large values of the radius.


page 1

page 2

page 3

page 4


On the list decodability of Rank Metric codes

Let $k,n,m \in \mathbb{Z}^+$ integers such that $k\leq n \leq m$, let $\...

Bounds on List Decoding of Linearized Reed-Solomon Codes

Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfi...

On the List Decodability of Self-orthogonal Rank Metric Codes

V. Guruswami and N. Resch prove that the list decodability of F_q-linear...

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

The list-decodability of random linear rank-metric codes is shown to mat...

Lattice (List) Decoding Near Minkowski's Inequality

Minkowski proved that any n-dimensional lattice of unit determinant has ...

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

We address the problem of decoding Gabidulin codes beyond their error-co...

On the Sparseness of Certain MRD Codes

We determine the proportion of [3× 3;3]-MRD codes over F_q within the s...