We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models, we consider an infinite family of linear maximum rank distance codes obtained by puncturing generalized twisted Gabidulin codes. We calculate the automorphism group of such codes, and we prove that this family contains many codes which are not equivalent to any generalized Gabidulin code. This solves a problem posed recently by Sheekey (Adv Math Commun 10:475–488, 2016).
Puncturing maximum rank distance codes / Csajbok, Bence; Siciliano, Alessandro. - In: JOURNAL OF ALGEBRAIC COMBINATORICS. - ISSN 0925-9899. - STAMPA. - 49:4(2019), pp. 507-534. [10.1007/s10801-018-0833-3]
Puncturing maximum rank distance codes
Csajbok, Bence;
2019-01-01
Abstract
We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models, we consider an infinite family of linear maximum rank distance codes obtained by puncturing generalized twisted Gabidulin codes. We calculate the automorphism group of such codes, and we prove that this family contains many codes which are not equivalent to any generalized Gabidulin code. This solves a problem posed recently by Sheekey (Adv Math Commun 10:475–488, 2016).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
