2GALLAGER R G.Low-Density Parity Chech Codes[J].IRE Trans.Info.Theory,1962,IT-8(1):1-28.
3MACKAY D J C,NEAL R M.Near Shannon limit performance of low densiy parity check codes[J].Electronics Letters,1996,32(8):1645-1646.
4MACKAY D J C.Good error-correcting codes based on very sparse matrices[J].IEEE Trans.Inform.Theory.1999,45(2):399-431.
5CHUNG S Y,FORNEY G D,RICHARDSON T J,et al.On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit[J].IEEE Commun.Lett.,2001,5(2):58-60.
6HU X Y,ELEFTHERIOU E,ARNOLD D M.Progressive edge-growth Tanner graphs[EB/OL].(2001-12-18)[ 2005-02-27 ].http://ieeexplore.ieee.org/ie15/7633/20833/00965567.pdf.
7DAVEY M,MACKAY D J C.Low-Density Parity Check Codes over GF(q)[J].IEEE Commun.Lett.,1998,2(6):165-167.
8SONG Hong-xin,CRUZ J R.Reduced-complexity Decoding of q-ary LDPC Codes for Magnetic Recording[J ].IEEE Trans.Mang.,2003,39(3):1081-1087.
9RICHARDSON T,URBANKE R.The capacity of low-density parity check codes under message-passing decoding[J ].IEEE Transactions on Information Theory,2001,47(2):599-618.
10Davey M C,MacKay D J C. Low density parity check codes over GF(q)[J].IEEE Communications Letters,1998,(06):165-167.doi:10.1109/4234.681360.
