Abstract: Left and right idealizers are important invariants of linear rank-distance codes. In the case of maximum rank-distance (MRD for short) codes in the idealizers have been proved to be isomorphic to finite fields of size at most . Up to now, the only known MRD codes with maximum left and right idealizers are generalized Gabidulin codes, which were first constructed in 1978 by Delsarte and later generalized by Kshevetskiy and Gabidulin in 2005. In this paper we classify MRD codes in for with maximum left and right idealizers and connect them to Moore-type matrices. Apart from generalized Gabidulin codes, it turns out that there is a further family of rank-distance codes providing MRD ones with maximum idealizers for , odd and for , . These codes are not equivalent to any previously known MRD code. Moreover, we show that this family of rank-distance codes does not provide any further examples for .
Recommendations
Cites work
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula>
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- A new family of MRD-codes
- A new family of linear maximum rank distance codes
- A unified description of four simply connected dimensional dual hyperovals
- Additive Rank Metric Codes
- Algebraic curves over a finite field
- Algebraic structures of MRD codes
- Automorphism groups of Gabidulin-like codes
- Bilinear forms over a finite field, with applications to coding theory
- Classes and equivalence of linear sets in \(\mathrm{PG}(1,q^{n})\)
- Coding for Errors and Erasures in Random Network Coding
- Dimensional dual hyperovals and APN functions with translation groups
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Exceptional scattered polynomials
- Finite semifields
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Generalized twisted Gabidulin codes
- Handbook of finite translation planes
- Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
- Linearized polynomials over finite fields revisited
- MRD-codes and linear sets
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- Maximum rank distance codes as space~time codes
- Maximum scattered linear sets and MRD-codes
- Maximum-rank array codes and their application to crisscross error correction
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- New maximum scattered linear sets of the projective line
- Non-linear maximum rank distance codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- On kernels and nuclei of rank metric codes
- On multi-Frobenius non-classical plane curves
- On scattered linear sets of pseudoregulus type in \(\operatorname{PG}(1,q^{t})\)
- On the Dickson-Guralnick-Zieve curve
- On the equivalence of linear sets
- On the genericity of maximum rank distance and Gabidulin codes
- On the number of inequivalent Gabidulin codes
- Orthogonal dual hyperovals, symplectic spreads, and orthogonal spreads
- Rank-metric codes and their duality theory
- Rank-metric codes, linear sets, and their duality
- Some new non-additive maximum rank distance codes
- Theory of codes with maximum rank distance
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
Cited in
(21)- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
- Linearized trinomials with maximum kernel
- Identifiers for MRD-codes
- A standard form for scattered linearized polynomials and properties of the related translation planes
- On the list decodability of rank-metric codes containing Gabidulin codes
- Explicit Artin maps into \(\mathrm{PGL}_2\)
- Extending two families of maximum rank distance codes
- MRD codes: constructions and connections
- Theory of codes with maximum rank distance
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes
- Partially scattered linearized polynomials and rank metric codes
- Erasure techniques in MRD codes.
- Asymptotics of Moore exponent sets
- Linear sets from projection of Desarguesian spreads
- Matrix graphs and MRD codes over finite principal ideal rings
- Rank-metric codes and their applications
- Constructing MRD codes by switching
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Codes with few weights arising from linear sets
- New results on quasi-subfield polynomials
This page was built for publication: MRD codes with maximum idealizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776314)
