Construction of LDPC codes for AWGN and binary erasure channels based on finite fields

Lingqi Zeng Lingqi Zeng,K Abdel-Ghaffar,L Lan,Shu Lin Shu Lin,Y.Y Tai

doi:10.1109/itw.2005.1531903

Construction of LDPC codes for AWGN and binary erasure channels based on finite fields

Lingqi Zeng Lingqi Zeng, K Abdel-Ghaffar + Show 3 more

https://doi.org/10.1109/itw.2005.1531903

Copy DOI

Publication Date: Jan 1, 2005

Citations: 3

Affiliation: University of California, Davis

#Binary Erasure Channels #Finite Fields + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text