Name
Abstract | ||
|---|---|---|
We consider linear rank-metric codes in . 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 . |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10623-017-0354-4 | Des. Codes Cryptography |
Keywords | DocType | Volume |
Rank-metric codes,Finite fields,MRD codes,Gabidulin codes,11T71 | Journal | abs/1605.05972 |
Issue | ISSN | Citations |
2 | 0925-1022 | 7 |
PageRank | References | Authors |
0.62 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessandro Neri | 1 | 14 | 6.10 |
| Anna-Lena Horlemann-Trautmann | 2 | 31 | 5.96 |
| Tovohery Randrianarisoa | 3 | 7 | 0.62 |
| Joachim Rosenthal | 4 | 142 | 17.90 |