Extending two families of maximum rank distance codes
This paper deals with the construction of MRD codes. In particular, the authors provide a new family of \(2\)-dimensional \(\mathbb{F}_{q^n}\)-linear MRD codes that properly contains the two families found by \textit{G. Longobardi} and \textit{C. Zanella} [J. Algebr. Comb. 53, No. 3, 639--661 (2021; Zbl 1465.94113)] and by \textit{G. Longobardi} et al. [``A large family of maximum scattered linear sets of \(\mathrm{PG}(1,qn)\) and their associated MRD codes, Preprint, \url{arXiv:2102.08287}]. The crucial part is proving that the constructed codes are in fact MRD. Since the authors focus on square matrices, they can identify the \(\mathbb{F}_q\)-algebra of \(n\times n\) matrices as the algebra of \(\sigma\)-polynomials, i.e. polynomials of the form \[ f(x)=\sum_{i=0}^{n-1} f_ix^{\sigma^i}, \quad f_i\in\mathbb{F}_{q^n}, \] where \(\sigma\) is a generator of the Galois group \(\mathrm{Gal}(\mathbb{F}_{q^n}/\mathbb{F}_q)\), and \(x^{\sigma}\) denotes the action of \(\sigma\) on \(x\). The authors give a general argument which allows to extend any construction of MRD codes based on \(\sigma\)-polynomials to any other generator \(\theta\) of the Galois group \(\mathrm{Gal}(\mathbb{F}_{q^n}/\mathbb{F}_q)\) under certain assumptions. Furthermore, they are able to show that the new codes they introduced are inequivalent to all the other known \(\mathbb{F}_{q^n}\)-linear MRD codes. Moreover, they investigate when two codes in this new wider family are equivalent, which turns to provide a lower bound on the number of equivalence classes of codes in this new family.
- A characterization of linearized polynomials with maximum kernel
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- A new family of linear maximum rank distance codes
- A new family of maximum scattered linear sets in \(\mathrm{PG}(1,q^6)\)
- 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>
- A new family of MRD-codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Abelian extensions of commutative rings
- Automorphism groups of Gabidulin-like codes
- Bilinear forms over a finite field, with applications to coding theory
- Connections between scattered linear sets and MRD-codes
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Field reduction and linear sets in finite geometry
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Generalized twisted Gabidulin codes
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- Identifiers for MRD-codes
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- Linear sets in finite projective spaces
- Linearized polynomials over finite fields revisited
- Maximum scattered linear sets and MRD-codes
- Maximum-rank array codes and their application to crisscross error correction
- MRD codes with maximum idealizers
- MRD codes: constructions and connections
- 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]\)
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- New maximum scattered linear sets of the projective line
- On kernels and nuclei of rank metric codes
- On the security of a Loidreau rank metric code based encryption scheme
- Rank-metric codes and \(q\)-polymatroids
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
- Rank-metric codes, linear sets, and their duality
- Scattered subspaces and related codes
- Some results on linearized trinomials that split completely
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Tensor representation of rank-metric codes
- Theory of codes with maximum rank distance
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- \(r\)-fat linearized polynomials over finite fields
- Linear sets on the projective line with complementary weights
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes
- Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes
- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
- Doubly and triply extended MSRD codes
- Constructions and equivalence of Sidon spaces
- Scattered trinomials of \(\mathbb{F}_{q^6} [X]\) in even characteristic
- A standard form for scattered linearized polynomials and properties of the related translation planes
- Clubs and their applications
- New scattered linearized quadrinomials
- Exceptional scattered sequences
- On generalized Sidon spaces
- Quotients of skew polynomial rings: new constructions of division algebras and MRD codes
- A new family of maximum linear symmetric rank-distance codes
- New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
- Automorphism groups of maximum scattered linear sets in finite projective lines
- New scattered subspaces in higher dimensions
- Towards the classification of maximum scattered linear sets of \(\mathrm{PG}(1,q^5)\)
- Scattered polynomials: an overview on their properties, connections and applications
- Maximum rank distance codes constructed from orthogonal groups
This page was built for publication: Extending two families of maximum rank distance codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2135573)
