Some new non-additive maximum rank distance codes (Q1696763)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6839001
Language Label Description Also known as
default for all languages
No label defined
    English
    Some new non-additive maximum rank distance codes
    scientific article; zbMATH DE number 6839001

      Statements

      Some new non-additive maximum rank distance codes (English)
      0 references
      0 references
      0 references
      15 February 2018
      0 references
      Most of the maximum rank distance (MRD) codes in the literature are additively closed and, in previous works, only one construction of not additively closed codes is introduced [\textit{A. Cossidente} et al., Des. Codes Cryptography 79, No. 3, 597--609 (2016; Zbl 1386.94112)] (and its generalization [\textit{N. Durante} and \textit{A. Siciliano}, Electron. J. Comb. 24, No. 2, Research Paper P2.33, 18 p. (2017; Zbl 1366.94585)]), working for some certain parameters. In this paper, the authors introduce a new construction of MRD codes as a generalization of generalized Gabidulin codes which are not additively closed when the basis field has odd characteristics. Moreover, such codes exist for all parameters. Therefore, these codes are the first non-additive MRD codes for most of the parameters.
      0 references
      rank metric codes
      0 references
      maximum rank distance (MRD) codes
      0 references
      additive generalized twisted Gabidulin codes
      0 references
      linearized polynomials
      0 references

      Identifiers