Paper Info
Title
Gabidulin Codes with Support Constrained Generator Matrices.
Abstract
Gabidulin codes are the only known general construction of linear codes that are maximum rank distant (MRD). They have found applications in linear network coding 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 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.
Year
DOI
Venue
2019
10.1109/tit.2019.2955106
IEEE Transactions on Information Theory
DocType
Volume
Citations 
Journal
abs/1903.09360
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Hikmet Yildiz142.84
Babak Hassibi28737778.04