1Gallager R G.Low Density Parity-check Codes[D].Cambridge:MIT Press,1963.
2Richardson T J,Shokrollahi M A,Urbanke R.Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes[J].IEEE Trans on Information Theory,2001,47(2):619-637.
4Hu Xiaoyu,Eleftheriou E,Arnold D M.Regular and irregular progressive edge-growth tanner graphs[J].IEEE Trans on Information Theory,2005,51(1):386-398.
2GALLAGER R G. Low Density Parity Check Codes[J]. IRE Trans Inf Theory, 1962, 4(08):21-28.
3高鹏.Turbo乘积码在衰落信道下的性能研究[D].南京解放军理工大学,2009.
4TANNER R M. A Recursive Approach to Low Complexity Codes[J]. IEEE Transaction on Information. Theory, 1981,27(09):533-547.
5Liu Z, PADOS D A. Low Complexity Decoding of Finite Geometry LDPC Codes[J].IEEE Trans on Communications, 2005,53(03):415-421.
6LEE C H, WOLF1 W. Implementation-efficient Reliability Ratio based Weighted Bit-flipping Decoding for LDPC Codes [J]. Electronic Letters, 2005,40(13):755-757.
