论文信息 - A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8

A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8

In this paper, we propose a class of regular LDPC codes from a cyclic difference family, which is a kind of combinatorial design. These LDPC codes have no 4-cycles, i.e., cycles of length 4. We clarify the conditions on which these codes with column weight 3 have no 6-cycles and discuss their minimum distance. Finally, we show the performance of the proposed codes with high rates and moderate lengths

Shojiro Sakata | Masaya Fujisawa

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

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

[3] Charles J. Colbourn,et al. Combinatorial Designs , 1999, Handbook of Discrete and Combinatorial Mathematics.

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

[5] Sarah J. Johnson,et al. Quasi-cyclic LDPC codes from difference families , 2002 .

[6] Sarah J. Johnson,et al. Resolvable 2-designs for regular low-density parity-check codes , 2003, IEEE Trans. Commun..

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

[8] Robert G. Gallager. Low Density Parity Check Code , 1962 .