MRD codes with maximum idealizers
From MaRDI portal
Publication:776314
DOI10.1016/J.DISC.2020.111985zbMATH Open1456.94131arXiv1807.08774OpenAlexW3026864023MaRDI QIDQ776314FDOQ776314
Authors: D. Kharzeev 
Publication date: 8 July 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1807.08774
Recommendations
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Finite semifields
- Algebraic curves over a finite field
- Theory of codes with maximum rank distance
- Linearized polynomials over finite fields revisited
- Non-linear maximum rank distance codes
- Coding for Errors and Erasures in Random Network Coding
- Title not available (Why is that?)
- Maximum-rank array codes and their application to crisscross error correction
- Rank-metric codes and their duality theory
- On the equivalence of linear sets
- Handbook of finite translation planes
- Orthogonal dual hyperovals, symplectic spreads, and orthogonal spreads
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Dimensional dual hyperovals and APN functions with translation groups
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Generalized twisted Gabidulin codes
- Automorphism groups of Gabidulin-like codes
- Maximum rank distance codes as space~time codes
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- A unified description of four simply connected dimensional dual hyperovals
- On scattered linear sets of pseudoregulus type in \(\operatorname{PG}(1,q^{t})\)
- Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
- MRD-codes and linear sets
- On multi-Frobenius non-classical plane curves
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- Maximum scattered linear sets and MRD-codes
- Some new non-additive maximum rank distance codes
- A new family of MRD-codes
- New maximum scattered linear sets of the projective line
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Additive Rank Metric Codes
- On the Dickson-Guralnick-Zieve curve
- Exceptional scattered polynomials
- On the number of inequivalent Gabidulin codes
- On the genericity of maximum rank distance and Gabidulin codes
- Classes and equivalence of linear sets in \(\mathrm{PG}(1,q^{n})\)
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- Rank-metric codes, linear sets, and their duality
- On kernels and nuclei of rank metric codes
- 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> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
Cited In (21)
- 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
- Title not available (Why is that?)
- 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.
- Linear sets from projection of Desarguesian spreads
- Asymptotics of Moore exponent sets
- 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
- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
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)
