DocumentCode
3046965
Title
Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes
Author
Zeng, Lingqi ; Lan, Lan ; Tai, Ying Y. ; Lin, Shu
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
Volume
3
fYear
2005
fDate
28 Nov.-2 Dec. 2005
Abstract
This paper presents three algebraic methods for constructing q-ary LDPC codes. The first method gives a class of dispersed Reed-Solomon codes as LDPC codes. The second method gives a class of q-ary quasi-cyclic LDPC codes. The third method gives two classes of q-ary finite geometry LDPC codes. Codes constructed by these methods perform very well with iterative decoding, even for short codes.
Keywords
Reed-Solomon codes; cyclic codes; iterative decoding; parity check codes; dispersed Reed-Solomon codes; iterative decoding; q-ary finite geometry; q-ary quasicyclic LDPC codes; Algorithm design and analysis; Belief propagation; Galois fields; Geometry; Iterative decoding; Null space; Parity check codes; Reed-Solomon codes; Sparse matrices; Sum product algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE
Print_ISBN
0-7803-9414-3
Type
conf
DOI
10.1109/GLOCOM.2005.1577842
Filename
1577842
Link To Document