1Chung S Y, Fomey G D, Richardson Jr 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.
2Fomey G D Jr. On iterative decoding and the two-way algorithm[J]. On Turbo Codes and Related Topics, 1997,12:15.
3Robert G, Gallager. Low density parity check codes[J]. IRE Trans, On Information Theory, 1962,1:21.
4Mao Y, Banihasherni A H. A new schedule for decoding low-density parity-check codes[J]. IEEE GlobeCom,Texas,2001,1007.
5Zhang J, Fossorier M. Shuffled belief propagation decoding. The Proceedings 36th Asilomar Conference on Signals[J ]. Systems and Computers, 2002,11 : 8.
6Eran Sharon. An efficient message-passing schedule for LDPC decoding[J ]. IEEE Commun Lett,2004,4:223.
7Richardson T, Urbanke R. The capacity of low density parity check nodes under message passing decoding[J]. IEEE Transon Inform Theory, 2000, 47:599.
8MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes[J ]. Electron. Lett, 1997,133(6) : 457.
9Kschischang F R, Frey B J, Loeliger H. Factor Graphs and the sum product algorithm[J]. IEEE Trans,On Information Theory, 2001,498.
