Large Girth Non-Binary LDPC Codes Based on Finite Fields and Euclidean Geometries

This letter presents an approach to the construction of non-binary low-density parity-check (LDPC) codes based on alpha-multiplied circulant permutation matrices and hyperplanes of two different dimensions in Euclidean geometries. Codes constructed by this method have large girth and high binary column weight when the order of Galois field is high. Simulation results show that these codes perform very well with fast Fourier transform (FFT) based sum-product algorithm (SPA).

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

[2]  Matthew C. Davey,et al.  Error-Correction using Low Density Parity Check Codes , 1999 .

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

[4]  D. Declercq,et al.  Fast Decoding Algorithm for LDPC over GF(2q) , 2003 .

[5]  Shu Lin,et al.  High Performance Nonbinary Quasi-Cyclic LDPC Codes on Euclidean Geometries , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[6]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[7]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[8]  Shu Lin,et al.  Codes on finite geometries , 2005, IEEE Transactions on Information Theory.

[9]  Zhenyu Liu,et al.  LDPC codes from generalized polygons , 2005, IEEE Transactions on Information Theory.

[10]  Kyeongcheol Yang,et al.  Quasi-cyclic LDPC codes for fast encoding , 2005, IEEE Transactions on Information Theory.

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