Navigation auf zora.uzh.ch

Search ZORA

ZORA (Zurich Open Repository and Archive)

On the genericity of maximum rank distance and Gabidulin codes

Neri, Alessandro; Horlemann-Trautmann, Anna-Lena; Randrianarisoa, Tovohery; Rosenthal, Joachim (2018). On the genericity of maximum rank distance and Gabidulin codes. Designs, Codes and Cryptography, 86(2):341-363.

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.

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Scopus Subject Areas:Physical Sciences > Computer Science Applications
Physical Sciences > Applied Mathematics
Language:English
Date:2018
Deposited On:08 Mar 2018 08:14
Last Modified:18 Dec 2024 02:38
Publisher:Springer
ISSN:0925-1022
Funders:Schweizerischer Nationalfonds
OA Status:Green
Publisher DOI:https://doi.org/10.1007/s10623-017-0354-4
Download PDF  'On the genericity of maximum rank distance and Gabidulin codes'.
Preview
  • Content: Accepted Version
  • Language: English

Metadata Export

Statistics

Citations

Dimensions.ai Metrics
39 citations in Web of Science®
42 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

60 downloads since deposited on 08 Mar 2018
9 downloads since 12 months
Detailed statistics

Authors, Affiliations, Collaborations

Similar Publications