[1] Elias P. Coding for Two Noisy Channel [C]//Proc 3rd London Symp, Information Theory. London: Buttersworth's Scientific Publications, 1955: 61-76.
[2] Robinson J P. A Class of Binary Recurrent Codes with Limited Error Propagation [J]. IEEE Trans on Informational Theory, 1967 13(1): 106-113.
[3] Cain J B. Punctured Convolutional Cedes of Rate (n-1)/n and Simplifide Maximum Likelihood Decoding [J]. IEEE Trans on Informational Theory, 1979, 25(1):97-100.
[4] Berrou C, Glavieux A. Near Optimum Error Correcting Coding and Decoding: Turbo-Codes[J]. IEEE Trans on Communication Theory, 1996, 44(10): 1261-1271.
[5] 杨洋, 陈超. LDPC码串行译码策略的收敛速度分析[J]. 西安电子科技大学学报, 2010, 37(5): 795-800.
Yang Yang, Chen Chao. Analysis of the Convergence Rate of Serial Schedule Based Decoding for LDPC Codes [J]. Journal of Xidian University, 2010, 37(5): 795-800.
[6] Pusane A E. Deriving Good LDPC Convolutional Codes from LDPC Block Codes[J]. IEEE Trans on Informational Theory, 2011, 57(2): 835-857.
[7] Abu-Surra S, Divsalar D, Ryan W E. Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes[J]. IEEE Trans on Informational Theory, 2011, 57(2): 858-886.
[8] Tan Peiyu, Li Jing. Efficient Quantum Stabilizer Codes: LDPC and LDPC-Convolutional Constructions[J]. IEEE Trans on Informational Theory, 2010, 56(1): 476-491.
[9] Bahl L. An Efficient Algorithm for Computing Free Distance[J]. IEEE Trans on Informational Theory, 1972, 18(3): 437-439.
[10] Shu Lin, Daniel J, Costello. Error Control Coding: Fundamentals and Applications [M]. 2nd ed. New Jersey: Pearson Education, 2004: 515-558.
[11] 王新梅, 肖国镇. 纠错码-原理与方法[M]. 西安: 西安电子科技大学出版社, 2001: 52-161.
[12] 彭万权, 冯文江. 乘积码基于相关运算的迭代译码 [J]. 电路与系统学报, 2006, 11(4): 26-30.
Peng Wanquan, Feng Wenjiang. A New Iterative Decoding for Product Codes with Correlation Operation[J]. Journal of Circuits and Systems, 2006, 11(4): 26-30.
[13] 金丕龄. 幻方的智慧[M].上海: 上海交通大学出版社, 2010.
[14] Sun F, Zhang T. Low-Power State-Parallel Relaxed Adaptive Viterbi Decoder[J]. IEEE Trans on Circuits and Systems, 2007, 54(5): 1060-1068. |