41 citations · 52 across the 4 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2019
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
Julian Renner, Thomas Jerkovits, Hannes Bartz +3
We address the problem of decoding Gabidulin codes beyond their unique error-correction radius. The complexity of this problem is of importance to assess the security of some rank-…
cs.IT2017★ 2 cited
Generalized Gabidulin codes over fields of any characteristic
Daniel Augot, Pierre Loidreau, Gwezheneg Robert
We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in…
cs.IT2006★ 3 cited
Properties of subspace subcodes of optimum codes in rank metric
E. M. Gabidulin, P. Loidreau
Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer power of a prime and any integer there is a family of MRD-co…