Non-Linear Maximum Rank Distance Codes in the Cyclic Model for the Field Reduction of Finite Geometries

In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese.

[1]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[2]  Michel Lavrauw,et al.  Subgeometries and linear sets on a projective line , 2014, Finite Fields Their Appl..

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

[4]  L. Carlitz.  A Note on the Betti-Mathieu group , 1963 .

[5]  R. H. Bruck.  The Automorphism Group of a Circle Geometry , 1982, J. Comb. Theory, Ser. A.

[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]  R. H. Dye,et al.  Spreads and classes of maximal subgroups ofGLn(q),SLn(q),PGLn(q) andPSLn(q) , 1991 .

[9]  P. Dembowski.  Finite geometries , 1997 .

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

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

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

[13]  Guglielmo Lunardon,et al.  MRD-codes and linear sets , 2017, J. Comb. Theory, Ser. A.

[14]  R. Trombetti,et al.  Maximum scattered linear sets of pseudoregulus type and the Segre variety $\mathcal{S}_{n,n}$ , 2012, 1211.3604.

[15]  B. Cooperstein.  External flats to varieties in PG(Mn,n(GF(q))) , 1997 .

[16]  J. Thas,et al.  General Galois geometries , 1992 .

[17]  György Kiss,et al.  The Cyclic Model for PG(n,q) and a Construction of Arcs , 2002, Eur. J. Comb..

[18]  Guglielmo Lunardon,et al.  Some remarks on the Spin Module Representation of Sp6(2e) , 2016, Discret. Math..

[19]  Baofeng Wu,et al.  Linearized polynomials over finite fields revisited , 2012, Finite Fields Their Appl..

[20]  J. Hirschfeld.  Projective Geometries Over Finite Fields , 1980 .

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

[22]  Beniamino Segre,et al.  Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane , 1964 .

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

[24]  Daniel Augot,et al.  Rank metric and Gabidulin codes in characteristic zero , 2013, 2013 IEEE International Symposium on Information Theory.

[25]  Nicola Durante,et al.  Scattered linear sets generated by collineations between pencils of lines , 2014 .

[26]  Frank R. Kschischang,et al.  Universal Secure Network Coding via Rank-Metric Codes , 2008, IEEE Transactions on Information Theory.

[27]  Bence Csajbók,et al.  On scattered linear sets of pseudoregulus type in PG(1, qt) , 2016, Finite Fields Their Appl..

[28]  R. H. Bruck.  Circle geometry in higher dimensions. II , 1973 .

[29]  R. CalderbankA.,et al.  Space-time codes for high data rate wireless communication , 2006 .

[30]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[31]  John Sheekey,et al.  On embeddings of minimum dimension of PG(n,q)×PG(n,q)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathrm{PG}}(n,q , 2013, Designs, Codes and Cryptography.

[32]  Olga Polverino,et al.  Linear sets in finite projective spaces , 2010, Discret. Math..

[33]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

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

[35]  Michel Lavrauw,et al.  Scattered Linear Sets and Pseudoreguli , 2013, Electron. J. Comb..