［1］贺鹤云.LDPC码基础与应用［M］.北京:人民邮电出版社,2009.

［2］FOSSORIER M P C.Quasi-cyclic low-density parity-check codes from circulant permutation matrices［J］.IEEE Transactions on Information Theory,2004,50(8):1788-1793.

［3］任红亮.基于代数方法构造的准循环 LDPC 码的研究［D］.南京:南京邮电大学,2006.

［4］Hu X Y,ELEFTHERIOU E,ARNOLD D M,et al.Efficient implementations of the sum-product algorithm for decoding LDPC codes［C］.IEEE Transactions on Information Theory,1981,27:533-547.

［5］FOSSORIER M P C,MIHALJEVIC M,IMAI H.Reduced complexity iterative decoding of low density parity check codes based on belief propagation［J］.IEEE Transaction on Communication,1999,47(5):673-680.

［6］范俊,肖扬.可快速编码的准循环LDPC码设计［J］.应用科学学报,2010(28):2-8.

［7］CHEN Ziqiang,SHAN Ouyang,XIAO Hailin.The design of efficiently-encodable LDPC codes for coded cooperation in relay channel ［C］.International Conference on Communications and Mobile Computing,2001:221-223.

［8］贺玉成.基于图模型的低密度校验码理论及应用研究［D］.西安:西安电子科技大学,2002.

［9］LI Zongwang,CHEN Lei,ZENG Lingqi,et al.Efficient encoding of quasi-cyclic low-density parity-check codes［J］.IEEE Transactions on Communications,2006,54(1):71-78.

［10］GALLAGER R G.Low-density parity-check codes［J］.IRE Transactions on Information Theory,1962.