Publication: On the genericity of maximum rank distance and Gabidulin codes
On the genericity of maximum rank distance and Gabidulin codes
Date
Date
Date
Citations
Neri, A., Horlemann-Trautmann, A.-L., Randrianarisoa, T., & Rosenthal, J. (2018). On the genericity of maximum rank distance and Gabidulin codes. Designs, Codes and Cryptography, 86, 341–363. https://doi.org/10.1007/s10623-017-0354-4
Abstract
Abstract
Abstract
We consider linear rank-metric codes in Fnqm. We show that the properties of being maximum rank distance (MRD) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabilities in dependence on the extension degree m.
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Neri, Alessandro
- Horlemann-Trautmann, Anna-Lena
- Randrianarisoa, Tovohery
- Rosenthal, Joachim
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Publisher DOI
Metrics
Downloads
Views
Citations
Neri, A., Horlemann-Trautmann, A.-L., Randrianarisoa, T., & Rosenthal, J. (2018). On the genericity of maximum rank distance and Gabidulin codes. Designs, Codes and Cryptography, 86, 341–363. https://doi.org/10.1007/s10623-017-0354-4
