A new family of MRD codes in with right and middle nuclei
arXiv:1709.03908 · doi:10.1109/TIT.2018.2853184
Abstract
In this paper, we present a new family of maximum rank distance (MRD for short) codes in of minimum distance . In particular, when , we can show that the corresponding semifield is exactly a Hughes-Kleinfeld semifield. The middle and right nuclei of these MRD codes are both equal to . We also prove that the MRD codes of minimum distance in this family are inequivalent to all known ones. The equivalence between any two members of this new family is also determined.
Compared with edition 1, several typos are corrected
References in corpus (12)
- Generalized Twisted Gabidulin Codes
- On kernels and nuclei of rank metric codes
- Algebraic structures of MRD Codes
- Properties of codes in rank metric
- New Criteria for MRD and Gabidulin Codes and some Rank-Metric Code Constructions
- On the Genericity of Maximum Rank Distance and Gabidulin Codes
- Properties of Codes with the Rank Metric
- On the number of inequivalent Gabidulin codes
- Maximum scattered linear sets and MRD-codes
- Exceptional Scattered Polynomials
- Classes and equivalence of linear sets in
- Maximum scattered -linear sets of
Cited by in corpus (9)
- Generalized Twisted Gabidulin Codes
- A Characterization of the Number of Roots of Linearized and Projective Polynomials in the Field of Coefficients
- New Semifields and new MRD Codes from Skew Polynomial Rings
- MRD codes with maximum idealizers
- Identifiers for MRD-codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
- A note on rank-metric codes
- Binary additive MRD codes with minimum distance n-1 must contain a semifield spread set