[1] Gallager R G. Low-density Parity-check Codes [J]. IRE Trans on Information Theory, 1962, 8(1): 21-28.
[2] Gallager R G. Low-Density Parity-Check Codes [D]. Cambridge: MIT Press, 1963.
[3] Mackay D J C, Neal R M. Near Shannon Limit Performance of Low-density Parity-check Codes [J]. Electronics Letters, 1996, 32(18): 1645-1646.
[4] Zhang L, Huang Q, Lin S, et al. Quasi-Cyclic LDPC Codes on Latin Squares and the Ranks of their Parity-Check Matrices [C]//Information Theory and Applications Workshop (ITA). 2010 Information Theory and Applications Workshop: 2. New York: IEEE Press, 2010: 1-7.
[5] Zhang L, Huang Q, Lin S, et al. Quasi-Cyclic LDPC Codes: an Algebraic Construction, Rank Analysis, and Codes on Latin Squares [J]. IEEE Trans on Communications, 2010, 58(11): 3126-3139.
[6] Zhang L, Lin S, Abdel-Ghaffar K, et al. Circulant Arrays: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes [C]//Information Theory Proceedings (ISIT). 2010 IEEE International Symposium on Information Theory: 3. New York: IEEE Press, 2010: 814-818.
[7] Kang J Y, Huang Q, Zhang L, et al. Quasi-Cyclic LDPC Codes: an Algebraic Construction [J]. IEEE Trans on Communications, 2010, 58(5): 1383-1396.
[8] Lin S, Song S M, Tai Y Y, et al. Algebraic Construction of Nonbinary Quasi-Cyclic LDPC Codes [C]//Communications, Circuits and Systems Proceedings. 2006 International Conference on Communications, Circuits and Systems Proceedings: 2. New York: IEEE Press, 2006: 1303-1308.
[9] Li Z W, Chen L, Zeng L Q, et al. Efficient Encoding of Quasi-cyclic Low-density Parity-check Codes [J]. IEEE Trans on Communications, 2006, 54(1): 71-81.
[10] 崔俊云, 白宝明, 郭旭东.一种改进的准循环LDPC码环消除算法 [J]. 西安电子科技大学学报, 2010, 37(4): 700-704.
Cui Junyun, Bai Baoming, Guo Xudong. Improved Cycle Elimination Algorithm for Construction of QC-LDPC Codes [J]. Journal of Xidian University, 2010, 37(4): 700-704.
[11] 杨洋, 陈超, 白宝明, 等. LDPC码串行译码策略的收敛速度分析 [J]. 西安电子科技大学学报, 2010, 37(5): 795-800.
Yang Yang, Chen Chao, Bai Baoming, et al. Analysis of the Convergence Rate of Serial Schedule Based Decoding for LDPC Codes [J]. Journal of Xidian University, 2010, 37(5): 795-800.
[12] Fan J L. Array Codes as Low-density Parity-check Codes [C]//Telecom Bretagne. Proc 2nd International Symposium on Turbo Codes and Related Topics: 1. New York: IEEE Press, 2000: 543-546.
[13] 詹伟, 朱光喜, 彭立. 利用斐波那契序列构造QC-LDPC码的方法 [J]. 华中科技大学学报(自然科学版), 2008, 36(10): 63-65.
Zhan Wei, Zhu Guangxi, Peng Li. Design of QC-LDPC Codes Using Fibonacci Sequence [J]. J Huazhong Univ of Sci & Tech(Natural Science Edition), 2008, 36(10): 63-65.
[14] Fossorier M P. Quasi-cyclic Low-density Parity-check Codes from Circulant Permutation Matrices [J]. IEEE Trans on Inform Theory, 2004, 50(8): 1788-1793.
[15] 焦晓鹏, 幕建君, 周利华. 一种Tanner图短环计数新方法 [J]. 西安电子科技大学学报, 2010, 37(2): 311-314.
Jiao Xiaopeng, Mu Jianjun, Zhou Lihua. Novel Method for Counting Short Cycles of Tanner Graphs [J]. Journal of Xidian University, 2010, 37(2): 311-314. |