New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences

A new family of quasi-cyclic low-density parity-check (LDPC) codes of girth at least eight is explicitly constructed from Sidon sequences. These codes can be encoded using simple shift-registers. Furthermore, for short to moderate lengths these quasi-cyclic codes perform close to random progressive edge-growth (PEG) LDPC codes in terms of bit-error probability and block-error probability, collectively.

[1]  David J. C. MacKay,et al.  Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.

[2]  William Ryan,et al.  Channel Codes: Classical and Modern , 2009 .

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

[4]  Moon Ho Lee,et al.  Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem , 2009, IEEE Communications Letters.

[5]  J. Yedidia,et al.  Construction of high-girth QC-LDPC codes , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[6]  K. O'Bryant.  A Complete Annotated Bibliography of Work Related to Sidon Sequences , 2004, math/0407117.

[7]  Yucheng He,et al.  Generalized Combining Method for Design of Quasi-Cyclic LDPC Codes , 2008, IEEE Communications Letters.

[8]  Navin Kashyap,et al.  Shortened Array Codes of Large Girth , 2005, IEEE Transactions on Information Theory.

[9]  J.M.F. Moura,et al.  Structured LDPC codes for high-density recording: large girth and low error floor , 2006, IEEE Transactions on Magnetics.

[10]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

[11]  Kyeongcheol Yang,et al.  A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem , 2005, IEEE Communications Letters.

[12]  Shu Lin,et al.  Channel Codes: Classical and Modern , 2009 .

[13]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[14]  William Ryan,et al.  Channel Codes by William Ryan , 2009 .

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

[16]  Jen-Fa Huang,et al.  Construction of quasi-cyclic LDPC codes from quadratic congruences , 2008, IEEE Communications Letters.

[17]  Xiaohu You,et al.  A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes , 2008, IEEE Transactions on Communications.

[18]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

[19]  Shu-Tao Xia,et al.  Structured non-binary LDPC codes with large girth , 2007 .