Additive Rank Metric Codes

We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest known linear MRD code family. Our family contains infinite families of non-linear MRD codes, which are the first non-linear examples for most of the parameters. We also give explicit examples and a table that demonstrates the proportion of linear and non-linear families for some small parameters.

[1]  Natalia Silberstein,et al.  Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks , 2014, IEEE Transactions on Information Theory.

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

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

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

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

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

[7]  Rocco Trombetti,et al.  Generalized Twisted Gabidulin Codes , 2015, J. Comb. Theory A.

[8]  Natalia Silberstein,et al.  Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams , 2008, IEEE Transactions on Information Theory.

[9]  Anna-Lena Horlemann-Trautmann,et al.  New criteria for MRD and Gabidulin codes and some Rank-Metric code constructions , 2015, Adv. Math. Commun..

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

[11]  Frank R. Kschischang,et al.  A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[12]  Ferruh Özbudak,et al.  Explicit constructions of some non-Gabidulin linear maximum rank distance codes , 2016, Adv. Math. Commun..

[13]  Z. Wan,et al.  Geometry of Matrices: In Memory of Professor L K Hua (1910 – 1985) , 1996 .

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

[15]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[16]  Alberto Ravagnani,et al.  Optimal Ferrers Diagram Rank-Metric Codes , 2014, IEEE Transactions on Information Theory.

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

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

[19]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[20]  Tuvi Etzion,et al.  Problems on q-Analogs in Coding Theory , 2013, ArXiv.