TY - JOUR
T1 - Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields
AU - Yildiz, Hikmet
AU - Hassibi, Babak
N1 - KAUST Repository Item: Exported on 2021-04-10
Acknowledgements: This work was supported in part by the National Science Foundation under Grant CNS-0932428, Grant CCF-1018927, Grant CCF1423663, and Grant CCF-1409204, in part by Qualcomm Inc., in part by the NASAs Jet Propulsion Laboratory through the President and Directors Fund, and in part by the King Abdullah University of Science and Technology
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2019/12
Y1 - 2019/12
N2 - We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size and with the same minimum distance. In particular, if the code has length n , and maximum minimum distance d (over all generator matrices with the given support), then an optimal code exists for any field size q≥ 2n-d. As a by-product of this result, we settle the GM-MDS conjecture in the affirmative.
AB - We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size and with the same minimum distance. In particular, if the code has length n , and maximum minimum distance d (over all generator matrices with the given support), then an optimal code exists for any field size q≥ 2n-d. As a by-product of this result, we settle the GM-MDS conjecture in the affirmative.
UR - http://hdl.handle.net/10754/668615
UR - https://ieeexplore.ieee.org/document/8786158/
UR - http://www.scopus.com/inward/record.url?scp=85077400188&partnerID=8YFLogxK
U2 - 10.1109/tit.2019.2932663
DO - 10.1109/tit.2019.2932663
M3 - Article
SN - 0018-9448
VL - 65
SP - 7868
EP - 7875
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 12
ER -