Generalized Twisted Gabidulin Codes

Abstract Let C be a set of m by n matrices over F q such that the rank of A − B is at least d for all distinct A , B ∈ C . Suppose that m ⩽ n . If # C = q n ( m − d + 1 ) , then C is a maximum rank distance (MRD for short) code. Until 2016, there were only two known constructions of MRD codes for arbitrary 1 d m − 1 . One was found by Delsarte (1978) [8] and Gabidulin (1985) [10] independently, and it was later generalized by Kshevetskiy and Gabidulin (2005) [16] . We often call them (generalized) Gabidulin codes. Another family was recently obtained by Sheekey (2016) [22] , and its elements are called twisted Gabidulin codes. In the same paper, Sheekey also proposed a generalization of the twisted Gabidulin codes. However the equivalence problem for it is not considered, whence it is not clear whether there exist new MRD codes in this generalization. We call the members of this putative larger family generalized twisted Gabidulin codes. In this paper, we first compute the Delsarte duals and adjoint codes of them, then we completely determine the equivalence between different generalized twisted Gabidulin codes. In particular, it can be proven that, up to equivalence, generalized Gabidulin codes and twisted Gabidulin codes are both proper subsets of this family.

[1]  John Sheekey,et al.  A new family of linear maximum rank distance codes , 2015, Adv. Math. Commun..

[2]  Ernst M. Gabidulin,et al.  The new construction of rank codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[3]  William M. Kantor,et al.  Commutative semifields and symplectic spreads , 2003 .

[4]  Nicola Durante,et al.  Non-Linear Maximum Rank Distance Codes in the Cyclic Model for the Field Reduction of Finite Geometries , 2017, Electron. J. Comb..

[5]  Giuseppe Marino,et al.  Non-linear maximum rank distance codes , 2016, Des. Codes Cryptogr..

[6]  Alfred Wassermann,et al.  Algebraic structures of MRD codes , 2015, Adv. Math. Commun..

[7]  Philippe Delsarte,et al.  Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.

[8]  A. Adrian Albert,et al.  Generalized twisted fields. , 1961 .

[9]  Z. Wan,et al.  Geometry of Matrices , 1996 .

[10]  Giuseppe Marino,et al.  A new family of MRD-codes , 2017, Linear Algebra and its Applications.

[11]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[12]  Norman L. Johnson,et al.  The Collineation Groups of Generalized Twisted Field Planes , 1999 .

[13]  Katherine Morrison,et al.  Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes , 2013, IEEE Transactions on Information Theory.

[14]  Rod Gow,et al.  Galois theory and linear algebra , 2009 .

[15]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[16]  Rod Gow,et al.  GALOIS EXTENSIONS AND SUBSPACES OF ALTERNATING BILINEAR FORMS WITH SPECIAL RANK PROPERTIES , 2009 .

[17]  Giuseppe Marino,et al.  New maximum scattered linear sets of the projective line , 2017, Finite Fields Their Appl..

[18]  Rudolf Lide,et al.  Finite fields , 1983 .

[19]  Ferruh Özbudak,et al.  Additive Rank Metric Codes , 2017, IEEE Transactions on Information Theory.

[20]  Ferruh Özbudak,et al.  Some new non-additive maximum rank distance codes , 2018, Finite Fields Their Appl..

[21]  Pierre Loidreau,et al.  Properties of codes in rank metric , 2006, ArXiv.

[22]  Ernst M. Gabidulin,et al.  Public_Key Cryptosystems Based on Linear Codes , 1995 .