Balanced Sparsest Generator Matrices for MDS Codes
Information Theory
2013-01-23 v1 math.IT
Abstract
We show that given and , for sufficiently large, there always exists an MDS code that has a generator matrix satisfying the following two conditions: (C1) Sparsest: each row of has Hamming weight ; (C2) Balanced: Hamming weights of the columns of differ from each other by at most one.
Cite
@article{arxiv.1301.5108,
title = {Balanced Sparsest Generator Matrices for MDS Codes},
author = {Son Hoang Dau and Wentu Song and Zheng Dong and Chau Yuen},
journal= {arXiv preprint arXiv:1301.5108},
year = {2013}
}
Comments
5 pages