Construction of QC-LDPC codes based on generalized RS codes with girth larger than 6

In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.

[1]  Khaled A. S. Abdel-Ghaffar,et al.  Quasi-cyclic LDPC codes on two arbitrary sets of a finite field , 2014, 2014 IEEE International Symposium on Information Theory.

[2]  Qin Huang,et al.  Quasi-cyclic LDPC codes: an algebraic construction , 2010, IEEE Transactions on Communications.

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

[4]  Qin Huang,et al.  Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices , 2010, 2010 Information Theory and Applications Workshop (ITA).

[5]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

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

[7]  Qiuju Diao,et al.  A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes , 2011, 2011 Information Theory and Applications Workshop.

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

[9]  Qin Huang,et al.  Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares , 2010, IEEE Transactions on Communications.

[10]  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.

[11]  Qin Huang,et al.  Quasi-cyclic LDPC codes: Construction and rank analysis of their parity-check matrices , 2012, 2012 Information Theory and Applications Workshop.

[12]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[13]  Zhi Ding,et al.  Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields , 2011, IEEE Transactions on Communications.

[14]  Baoming Bai,et al.  Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fields , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme , 2014, IEEE Transactions on Communications.

[16]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.