Sparse generator matrices for some families of Quasi-Cyclic Low-Density Parity-Check codes

In this paper, we provide a general form for sparse generator matrices of several families of Quasi-Cyclic Low-Density Parity-Check codes. Codes of this kind have a prominent role in literature and applications due to their ability to achieve excellent performance with limited complexity. While some properties of these codes (like the girth length in their associated Tanner graphs) are well investigated, estimating their minimum distance is still an open problem. By obtaining sparse generator matrices for several families of these codes, we prove that they are also Quasi-Cyclic Low-Density Generator Matrix codes, which is an important feature to reduce the encoding complexity, and provides a useful tool for the investigation of their minimum distance.

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

[2]  R. M. Tanner,et al.  A Class of Group-Structured LDPC Codes , 2001 .

[3]  Marco Baldi,et al.  On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes , 2011, IEEE Transactions on Information Theory.

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

[5]  Giovanni Cancellieri,et al.  Polynomial Theory of Error Correcting Codes , 2014 .

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

[7]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[8]  Qiuju Diao,et al.  A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes , 2012, IEEE Transactions on Information Theory.

[9]  Roberto Garello,et al.  Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem , 2007, 2007 IEEE International Conference on Communications.

[10]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[11]  T. Aaron Gulliver,et al.  More on the Stopping and Minimum Distances of Array Codes , 2011, IEEE Transactions on Communications.

[12]  Norifumi Kamiya,et al.  High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes , 2005, IEEE Transactions on Information Theory.

[13]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[14]  Wei Zhong,et al.  Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix , 2003, IEEE Communications Letters.

[15]  Torleiv Kløve,et al.  On the generator matrix of array LDPC codes , 2012, SoftCOM 2012, 20th International Conference on Software, Telecommunications and Computer Networks.