DocumentCode
640217
Title
Separating redundancy of linear MDS codes
Author
Abdel-Ghaffar, Khaled A. S. ; Weber, Jens H.
Author_Institution
Dept. ECE, Univ. of California, Davis, Davis, CA, USA
fYear
2013
fDate
7-12 July 2013
Firstpage
1894
Lastpage
1898
Abstract
Linear codes over channels causing erasures and errors can be decoded by deleting the erased symbols and decoding the resulting vector with respect to a punctured code. To facilitate decoding of MDS codes, parity-check matrices are proposed that contain, as submatrices, parity-check matrices of the punctured codes. Depending on the maximum number of erasures, the separating redundancy, which is the smallest number of rows in the proposed parity-check matrices, is determined.
Keywords
channel coding; decoding; linear codes; matrix algebra; parity check codes; redundancy; decoding; erased symbol deletion; linear MDS codes; parity-check matrices; punctured codes; separating redundancy; submatrices; Decoding; Hamming distance; Iterative decoding; Linear codes; Redundancy; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620555
Filename
6620555
Link To Document