Algebraic structures of MRD Codes

Abstract

Based on results in finite geometry we prove the existence of MRD codes in (F_q)_(n,n) with minimum distance n which are essentially different from Gabidulin codes. The construction results from algebraic structures which are closely related to those of finite fields. Some of the results may be known to experts, but to our knowledge have never been pointed out explicitly in the literature.

Cited by in corpus (17)

• Generalized Twisted Gabidulin Codes
• On kernels and nuclei of rank metric codes
• Rank distribution of Delsarte codes
• New Criteria for MRD and Gabidulin Codes and some Rank-Metric Code Constructions
• New Semifields and new MRD Codes from Skew Polynomial Rings
• A new family of MRD codes in ${\mathbb{F}}_q^{2n\times 2n}$ with right and middle nuclei ${\mathbb{F}}_{q^n}$
• Vertex properties of maximum scattered linear sets of $\mathrm{PG}(1,q^n)$
• MRD codes with maximum idealizers
• Identifiers for MRD-codes
• On the number of inequivalent Gabidulin codes
• Classification of large partial plane spreads in $PG(6,2)$ and related combinatorial objects
• Nuclei and automorphism groups of generalized twisted Gabidulin codes
• Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
• Constructing MRD codes by switching
• Partitions of Matrix Spaces With an Application to $q$-Rook Polynomials
• Fuzzy Authentication using Rank Distance
• Binary additive MRD codes with minimum distance n-1 must contain a semifield spread set