| [1] | Tanner R M, Sridhara D, and Sridhara A, et al.. LDPC blockand convolutional codes based on circulant matrices[J].IEEETrans. on Inform. Theory.2004, 50(12):2966-2984[2]Fossorier M. Quasi-cyclic low-density parity-check codes fromcirculant permutation matrices[J].IEEE Trans. on Inform.Theory.2004, 50(8):1788-1793[3]Fan J L. Array codes as low-density parity-check codes[C]. InProc. 2nd Int. symp. turbo codes and related topics, brest,France, sept. 4-7, 2000: 553-556.[4]Yoshida K, Brockman J, and Costello D, et al.. VLSIimplementation of quasi cyclic LDPC codes[C]. In Proc.2004Int. Symp. Information Theory and its Application, Italy,Oct.10-13, 2004: 551-556.[5]Chen Z G and Bates S. Construction of low-densityparity-check convolutional codes through progressive edgegrowth[J].IEEE Communications Letters.2005, 9(12):1058-1060[6]Ko Y J and Kim J H. Girth conditioning for construction ofshort block length irregular LDPC codes [J]. ElectronicsLetters, 2004, 40(3): 187-188.[7]Milenkovic O. Shortened array codes of large girth[J].IEEETrans. on Inform. Theory.2006, 52(8):3707-3722[8]Mao Y M and Banihashemi A H. A heuristic search for goodlow-denstiy parity-check codes at short block lengths[C].InIEEE ICC2001, St.-Petersburg, Russia, June 11-15, 2001:41-44.[9]Hu X Y and Fossorier M. On the computation of theminimum distance of low-density parity-check codes [C]. InIEEE ICC2004, Paris, France, June 20-24, 2004: 767-771. |