Identifiers for MRD-codes
| Autor: | Luca Giuzzi, Ferdinando Zullo |
|---|---|
| Přispěvatelé: | Giuzzi, Luca, Zullo, Ferdinando |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Discrete mathematics
Numerical Analysis Algebra and Number Theory Gabidulin codes Rank metric Distinguisher 51E22 05B25 94B05 Identifier Maximum rank Field extension FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Combinatorics (math.CO) Geometry and Topology Equivalence (formal languages) Mathematics Computer Science::Information Theory |
| Popis: | For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\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. 23 pages/post-print version |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|