Construction of LDPC codes for AWGN and binary erasure channels based on finite fields
Lingqi Zeng, Longwen Lan, Y.Y. Tai, Shu Lin, Khaled Abdel-Ghaffar · 2005
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.