A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the list decodability of Rank Metric codes
[article]

2020
*
arXiv
*
pre-print

Let k,n,m ∈Z^+ integers such that k≤ n ≤ m, let G_n,k∈F_q^m^n be a Delsarte-Gabidulin code. Wachter-Zeh proven 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^n ∖G_n,k. In 2016, 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

arXiv:1907.01289v2
fatcat:oab2kb3tnratffryrkwzzobzki