DocumentCode
2407969
Title
Construction of LDPC codes for AWGN and binary erasure channels based on finite fields
Author
Zeng, Lingqi ; Lan, Lan ; Tai, Ying Y. ; Lin, Shu ; Abdel-Ghaffar, Khaled
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
fYear
2005
fDate
29 Aug.-1 Sept. 2005
Abstract
This paper presents a method for constructing structured LDPC codes based on finite fields and affine mappings. The Tanner graphs of these codes have girth at least six. Experimental results show that codes constructed based on this method with iterative decoding perform well on both the AWGN and binary erasure channels. Furthermore, codes constructed based on prime fields are quasi-cyclic.
Keywords
AWGN channels; binary sequences; cyclic codes; graph theory; iterative decoding; parity check codes; AWGN channels; LDPC codes construction; Tanner graph; affine mapping; binary erasure channel; finite field; iterative decoding; prime field; quasicyclic code; AWGN; Bismuth; Block codes; Galois fields; Iterative decoding; Null space; Parity check codes; Reed-Solomon codes; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2005 IEEE
Print_ISBN
0-7803-9480-1
Type
conf
DOI
10.1109/ITW.2005.1531903
Filename
1531903
Link To Document