DocumentCode
3278289
Title
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
Author
Kamiya, Norifumi ; Sasaki, Eisaku
Author_Institution
Common Platform Software Res. Labs., NEC Corp., Ikoma
fYear
2008
fDate
7-10 Dec. 2008
Firstpage
1
Lastpage
6
Abstract
In this paper, we present an efficient systematic encoding algorithm for quasi-cyclic (QC) low-density parity-check (LDPC) codes which are related to cyclic maximum-distance separable (MDS) codes. The algorithm has linear time complexity, and it can be easily implemented by using polynomial multiplication and division circuits. We show that the division polynomials can be completely characterized by its zeros and that the sum of the numbers of the zeros is equal to the parity-length of the codes.
Keywords
computational complexity; encoding; parity check codes; polynomials; QC-LDPC codes; cyclic MDS codes; cyclic maximum-distance separable codes; division circuits; encoding; linear time complexity; polynomial multiplication; quasicyclic low-density parity-check codes; Algebra; Application software; Chromium; Circuits; Electronic mail; Encoding; Information theory; National electric code; Parity check codes; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location
Auckland
Print_ISBN
978-1-4244-2068-1
Electronic_ISBN
978-1-4244-2069-8
Type
conf
DOI
10.1109/ISITA.2008.4895414
Filename
4895414
Link To Document