Title :
Balanced Sparsest generator matrices for MDS codes
Author :
Son Hoang Dau ; Wentu Song ; Zheng Dong ; Chau Yuen
Author_Institution :
Singapore Univ. of Technol. & Design, Singapore, Singapore
Abstract :
We show that given n and k, for q sufficiently large, there always exists an [n, k]q MDS code that has a generator matrix G satisfying the following two conditions: (C1) Sparsest: each row of G has Hamming weight n - k + 1; (C2) Balanced: Hamming weights of the columns of G differ from each other by at most one.
Keywords :
Hamming codes; block codes; network coding; sparse matrices; Hamming weight; MDS code; balanced sparsest generator matrix; maximum distance separable codes; Base stations; Encoding; Error correction codes; Generators; Hamming weight; Polynomials;
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
DOI :
10.1109/ISIT.2013.6620554
