English

Identifiers for MRD-codes

Combinatorics 2019-04-16 v3

Abstract

For any admissible value of the parameters nn and kk there exist [n,k][n,k]-Maximum Rank distance Fq{\mathbb F}_q-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are MRD. On the other hand, very few families up to equivalence of such codes are currently known. In the present paper we study some invariants of MRD codes and evaluate their value for the known families, providing a new characterization of generalized twisted Gabidulin codes.

Keywords

Cite

@article{arxiv.1807.09476,
  title  = {Identifiers for MRD-codes},
  author = {Luca Giuzzi and Ferdinando Zullo},
  journal= {arXiv preprint arXiv:1807.09476},
  year   = {2019}
}

Comments

23 pages/post-print version

R2 v1 2026-06-23T03:13:37.164Z