Construction of Quasi-Cyclic LDPC Codes From Prime Fields

Gallager R G. Low density parity check codes[J]. IEEEInformation Theory, 1962, IT-8( 1): 21-28.[2]MacKay D J C and Neal R M. Near Shannon limitperformance of low density parity check codes[J].IEEElectron. Letters.1996, 32(18):1645-1646[3]Dai Y, Yan Z, and Chen N. Optimal overlapped messagepassing decoding of quasi-cyclic LDPC codes[J]. IEEE VeryLarge Scale Integration Systems, 2007, 16(5): 565-578.[4]LiZ, Chen L, Zeng L, Lin S, and Fong W. Efficient encodingof quasi-cyclic low-density parity-check codes[J]. IEEECommunication, 2006, 54(1): 71-81.[5]Wang Z and Cui Z. A memory efficient partially paralleldecoder architecture for QC-LDPC codes[J].IEEE VeryLarge Scale Integration Systems.2007, 15(4):483-488[6]Lan L, Zeng L Q Y, Tai Y, Chen L, Lin S, and Abdel-GhaffarK. Construction of quasi-cyclic LDPC codes for AWGN andbinary erasure channels: A finite field approach[J].IEEEInformation Theory.2007, 53(7):2429-2458