C Y Di,D Proietti,I E Telatar,T J Richardson,R L Urbanke.Finite-length analysis of low-density parity-check codes on the binary erasure channel[J].IEEE Trans Inform Theory,June 2002 48(6):1570-1579.
[2]
X Y Hu,M P C Fossorier,E.Eleftheriou.On the computation of the minimum distance of low-density parity-check codes[A].Proc 2004 IEEE Int Conf Communications[C].Paris,France:IEEE Press,2004,2:767-771.
[3]
Y Kou,S Lin,M Fossorier.Low-density parity-check codes based on finite geometries a rediscovery and new results[J].IEEE Trans Inform.Theory,Nov.2001,47(7):2711-2736.
[4]
D J C MacKay,R M Neal.Near Shannon limit performance of low density parity check codes[J].IEE Electron Lett,1996,32(18):1645-1646,
[5]
L Wei.Several properties of short LDPC codes[J].IEEETrans.Commun,May 2004,52(5):721-727.
[6]
C Berrou,S Vaton,M Jezequel,C Douillard.Computing the minimum distance of linear codes by the error impulse method[A].Proc IEEE Gloobal Telecommunications Conference[C].Taipei,Taiwan:IEEE Press.2002,2:1017-1020.
[7]
R Garello,P Pierleoni,S Benedetto.Computing the free distance of turbo codes and serially concatenated codes with Interleavers:algorithms and applications[J].IEEE J Select Areas Commun.,May 2001,19(5):800-812.
[8]
B Ammar,B Honary,Y Kou,J Xu,S Lin.Construction of lowdensity parity-check codes based on balanced incomplete block designs[J].IEEE Trans Inform Theory,June 2004,50(6):1257-1268.
[9]
R Echard,S C Chang.Design considera-tions leading to the development of good π-rotation LDPC codes[J].IEEE Commun Lett,May,2005,9(5):447-449.
