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

semifieldMRD coderank metric code

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.

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

• 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?)
• 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 Rank-Metric Approach to Error Control in Random Network Coding
• A new family of linear maximum rank distance codes
• 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
• MRD codes: constructions and connections
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
• Maximum scattered linear sets and MRD-codes
• Non-linear maximum rank distance codes
• On Metrics for Error Correction in Network Coding
• On a Kaplansky conjecture concerning three-dimensional division algebras over a finite field
• On the genericity of maximum rank distance and Gabidulin codes
• On the stabilizer of companion matrices
• Theory of codes with maximum rank distance
• \(n\)-dimensional algebras over a field with a cyclic extension of degree \(n\)

Cited in

(9)

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

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)