New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels

This paper presents two new methods for constructing quasi-cyclic LDPC codes using certain special classes of balanced incomplete block designs constructed based on finite fields. The codes constructed perform well with iterative decoding over both AWGN and binary erasure channels.

[1]  Khaled A. S. Abdel-Ghaffar,et al.  On algebraic construction of Gallager and circulant low-density parity-check codes , 2004, IEEE Transactions on Information Theory.

[2]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

[3]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[4]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[5]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[6]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[7]  R. C. Bose.  ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .

[8]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[9]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[10]  A. Orlitsky,et al.  Stopping sets and the girth of Tanner graphs , 2002, Proceedings IEEE International Symposium on Information Theory,.

[11]  Bahram Honary,et al.  Construction of low-density parity-check codes based on balanced incomplete block designs , 2004, IEEE Transactions on Information Theory.

[12]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[13]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[14]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[15]  Shu Lin,et al.  Construction of low-density parity-check codes by superposition , 2005, IEEE Transactions on Communications.

[16]  R. M. Tanner.  Spectral graphs for quasi-cyclic LDPC codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[17]  Shu Lin,et al.  A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.

[18]  Henry B. Mann,et al.  Analysis and design of experiments. , 1950 .

[19]  Shu Lin,et al.  Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2004, IEEE Trans. Commun..