On the List Decodability of Rank Metric Codes

Let k, n, m ∈ ℤ
⁺
be integers such that k ≤ n ≤ m, let G
_n,k
∈ F
ⁿ
(q
^m
) be a Delsarte-Gabidulin code. Recently, Wachter-Zeh proved that codes belonging to this family cannot be efficiently list decoded for any radius τ, providing τ is large enough. This achievement essentially relies on proving a lower bound for the list size of some specific words in F
ⁿ
(q
^m
). Some years later, Raviv and Wachter-Zeh improved this bound in a special case, i.e. when n|m. As a consequence, they were able to detect infinite families of Delsarte-Gabidulin codes that cannot be efficiently list decoded at all. In this article we determine similar lower bounds for Maximum Rank Distance codes belonging to a wider class of examples, containing Generalized Gabidulin codes, Generalized Twisted Gabidulin codes, and examples recently described by Trombetti and Zhou. By exploiting arguments such as those used by Raviv and Wachter-Zeh, when n|m, we also show infinite families of generalized Gabidulin codes that cannot be list decoded efficiently at any radius greater than or equal to ⌊d-1/2⌋ + 1, where d is its minimum distance. Nonetheless, in all the examples belonging to above mentioned class, we detect infinite families that cannot be list decoded efficiently at any radius greater than or equal to ⌊d-1/2⌋ + 2, where d is its minimum distance. In particular, this leads to show infinite families of Gabidulin codes, with underlying parameters not already covered by the result of Raviv and Wachter-Zeh, having this decodability defect. Finally, relying on the properties of a set of subspace trinomials recently presented by McGuire and Mueller, we are able to prove our main result, that is any rank-metric code of F
ⁿ
(q
^m
) of order q
^kn
with n dividing m, such that 4n - 3 is a square in ℤ and containing G
_n,2
, is not efficiently list decodable at some values of the radius τ.