Gabidulin Codes With Support Constrained Generator Matrices

Gabidulin codes are the first general construction of linear codes that are maximum rank distant (MRD). They have found applications in linear network coding, for example, when the transmitter and receiver are oblivious to the inner workings and topology of the network (the so-called incoherent regime). The reason is that Gabidulin codes can be used to map information to linear subspaces, which in the absence of errors cannot be altered by linear operations, and in the presence of errors can be corrected if the subspace is perturbed by a small rank. Furthermore, in distributed coding and distributed systems, one is led to the design of error correcting codes whose generator matrix must satisfy a given support constraint. In this paper, we give necessary and sufficient conditions on the support of the generator matrix that guarantees the existence of Gabidulin codes and general MRD codes. When the rate of the code is not very high, this is achieved with the same field size necessary for Gabidulin codes with no support constraint. When these conditions are not satisfied, we characterize the largest possible rank distance under the support constraints and show that they can be achieved by subcodes of Gabidulin codes. The necessary and sufficient conditions are identical to those that appear for MDS codes which were recently proven by Yildiz et al. and Lovett in the context of settling the GM-MDS conjecture.

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

[2]  Babak Hassibi,et al.  Optimum Linear Codes with Support Constraints over Small Fields , 2018, 2018 IEEE Information Theory Workshop (ITW).

[3]  Shachar Lovett.  MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  John Sheekey,et al.  New semifields and new MRD codes from skew polynomial rings , 2018, Journal of the London Mathematical Society.

[5]  Alexander Sprintson,et al.  Weakly secure data exchange with Generalized Reed Solomon codes , 2014, 2014 IEEE International Symposium on Information Theory.

[6]  Babak Hassibi,et al.  Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[7]  Chau Yuen,et al.  On the existence of MDS codes over small fields with constrained generator matrices , 2014, 2014 IEEE International Symposium on Information Theory.

[8]  Babak Hassibi,et al.  Balanced Reed-Solomon codes for all parameters , 2016, 2016 IEEE Information Theory Workshop (ITW).

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

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

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

[12]  Tracey Ho,et al.  Distributed reed-solomon codes for simple multiple access networks , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  K. Conrad.  Finite Fields , 2004, Series and Products in the Development of Mathematics.

[14]  Alessandro Neri,et al.  Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices , 2018, Linear Algebra and its Applications.

[15]  Wentu Song,et al.  Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[16]  John Sheekey,et al.  Further Generalisations of Twisted Gabidulin Codes , 2017, 1703.08093.

[17]  Tracey Ho,et al.  Distributed gabidulin codes for multiple-source network error correction , 2014, 2014 International Symposium on Network Coding (NetCod).

[18]  Chau Yuen,et al.  On Simple Multiple Access Networks , 2015, IEEE Journal on Selected Areas in Communications.

[19]  Gary R. W. Greaves,et al.  Reed–Solomon Codes Over Small Fields With Constrained Generator Matrices , 2019, IEEE Transactions on Information Theory.

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

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

[22]  Babak Hassibi,et al.  Balanced Reed-Solomon codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[23]  Alexander Sprintson,et al.  An algebraic-combinatorial proof technique for the GM-MDS conjecture , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).