Gallager R G. Low density parity check codes[J]. IEEE Trans Inf Theory, 1962, 8(1): 21-28.
[2]
Mackay D J C, Neal R M. Near Shannon limit performance of low density parity check codes[J]. IEE ElectronLett, 1996, 32(18): 1645-1646.
[3]
Richardson T J, Urbanke R L. The capacity of low-density parity-check codes under message-passing decoding[J]. IEEE Trans Inf Theory, 2001, 47(2): 599-618.
[4]
Davey M C, Mackay D J C. Low-density parity check codes over GF(2q) [J]. IEEE Communications Letters, 1998, 2(6): 165-167.
[5]
Davey M C. Error-correction using low-density parity-check codes. Cambridge: University of Cambridge, 1999.
[6]
Davey M C, MacKay D J C. Monte Carlo simulations of infinite low density parity check codes over GF(q)//ProcIntWorkshop on Optimal Codes and related Topics (OC'98), Bulgaria: , 1998: 9-15.
[7]
Hu X Y, Eleftheriou E. Binary representation of cycle Tanner-graph GF(2b) codes//Proc IEEE Intern Confon Communications. Paris: , 2004: 528-532.
[8]
Richardson T J, Urbanke R. Efficient encoding of low-density parity-check codes[J]. IEEE Trans Inf Theory, 2001, 47(2): 638-656.
[9]
Myung S, Yang K, Kim J. Quasi-cyclic LDPC codes for fast encoding. IEEE Trans Inf Theory, 2005, 51(2): 2894-2901.
[10]
Poulliat C, Fossorier M, Declercq D. Design of regular (2, dc)-LDPC codes over GF(q) using their binary images[J]. IEEE Trans Communication, 2008, 56(3): 1626-1635.
