Title
Gabidulin Codes With Support Constrained Generator Matrices.
Abstract
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...
Year
DOI
Venue
2020
10.1109/TIT.2019.2955106
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Generators,Linear codes,Network coding,Hamming distance,Measurement,Transmitters,Receivers
Journal
66
Issue
ISSN
Citations 
6
0018-9448
1
PageRank 
References 
Authors
0.37
0
2
Name
Order
Citations
PageRank
Hikmet Yildiz142.84
Babak Hassibi28737778.04