On the sparseness of certain linear MRD codes

DOI10.1016/J.LAA.2020.03.006MaRDI QIDQ2309683zbMATH OpenOpenAlexFDO

Authors Heide Gluesing-Luerssen

Publication date 1 April 2020

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.11691

zbMATH Keywords

MRD coderank metric codesemifield

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Abstract: We determine the proportion of $[3imes3;3]$-MRD codes over ${mathbbF}_q$ within the space of all $3$-dimensional $3imes3$-rank-metric codes over the same field. This shows that for these parameters MRD codes are sparse in the sense that the proportion tends to $0$ as $qightarrowinfty$. This is so far the only parameter case for which MRD codes are known to be sparse. The computation is accomplished by reducing the space of all such rank-metric codes to a space of specific bases and subsequently making use of a result by Menichetti (1973) on 3-dimensional semifields.

Review text

One of the most studied question regarding rank metric codes is whether the MRD codes of \(\mathbb{F}_{q}^{m\times n}\) (under certain conditions) are dense or not in \(\mathbb{F}_{q}^{m\times n}\). \textit{A. Neri} et al. [Des. Codes Cryptography 86, No. 2, 341--363 (2018; Zbl 1412.94247)] proved that the family of \(\mathbb{F}_{q^m}\)-linear MRD codes (i.e.\ those having one of the idealisers isomorphic to \(\mathbb{F}_{q^m}\)) is dense in the family of rank metric codes of \(\mathbb{F}_{q}^{m\times n}\) having the same dimension. This is not true whenever we consider \(\mathbb{F}_q\)-linear MRD codes: \textit{E. Byrne} and \textit{A. Ravagnani} [J. Comb. Theory, Ser. A 171, Article ID 105169, 39 p. (2020; Zbl 1467.94047)] proved that the density of \(\mathbb{F}_q\)-linear MRD codes in \(\mathbb{F}_{q}^{m\times n}\) in the set of all matrix codes of the same dimension is asymptotically at most \(1/2\), both as \(q \rightarrow +\infty\) and as \(m \rightarrow +\infty\). See also the paper [\textit{J. Antrobus} and \textit{H. Gluesing-Luerssen}, IEEE Trans. Inf. Theory 65, No. 10, 6204--6223 (2019; Zbl 1432.94182)]. In the paper under review, the author determines the proportion of the family of MRD codes in \(\mathbb{F}_q^{3 \times 3}\) having minimum distance \(3\) in the space of \(3\)-dimensional \(\mathbb{F}_q\)-linear rank metric codes of \(\mathbb{F}_q^{3\times 3}\), obtained by using a result of \textit{G. Menichetti} [Ann. Mat. Pura Appl. (4) 97, 283--301 (1973; Zbl 0281.13005)] on \(3\)-dimensional semifields. As a consequence, the author shows that such MRD codes are sparse as this proportion goes to zero as \(q \rightarrow +\infty\). This is the only parameter case for which MRD codes are known to be sparse.

Recommendations

• A new family of MRD-codes
• MRD-codes and linear sets
• MRD codes: constructions and connections
• Maximum scattered linear sets and MRD-codes
• MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)

Cites work

• \(n\)-dimensional algebras over a field with a cyclic extension of degree \(n\)
• A new family of linear maximum rank distance 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>
• A Rank-Metric Approach to Error Control in Random Network Coding
• Algebre tridimensionali su un campo di Galois
• Bilinear forms over a finite field, with applications to coding theory
• Finite semifields and projective planes
• Generalized twisted Gabidulin codes
• scientific article; zbMATH DE number 3135133 (Why is no real title available?)
• scientific article; zbMATH DE number 3552723 (Why is no real title available?)
• scientific article; zbMATH DE number 3257050 (Why is no real title available?)
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
• Maximum scattered linear sets and MRD-codes
• MRD codes: constructions and connections
• Non-linear maximum rank distance codes
• On a Kaplansky conjecture concerning three-dimensional division algebras over a finite field
• On Metrics for Error Correction in Network Coding
• On the genericity of maximum rank distance and Gabidulin codes
• On the stabilizer of companion matrices
• Theory of codes with maximum rank distance

Cited in

(12)

• Partition-balanced families of codes and asymptotic enumeration in coding theory
• Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
• Bounds in the Lee metric and optimal codes
• Connections between scattered linear sets and MRD-codes
• Common Complements of Linear Subspaces and the Sparseness of MRD Codes
• Rank-metric codes and their applications
• Rank-Metric Codes, Semifields, and the Average Critical Problem
• Densities of codes of various linearity degrees in translation-invariant metric spaces
• On additive MDS codes with linear projections
• Whitney numbers of rank-metric lattices and code enumeration
• Valued rank-metric codes
• Better bounds on the minimum Lee distance

This page was built for publication: On the sparseness of certain linear MRD codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309683)