On the girth of Tanner (3, 5) quasi-cyclic LDPC codes

IEEE Transactions on Information Theory

Volumn 52, Issue 4, 2006, Pages 1739-1744

  Kim, Sunghwan ^a   No, Jong Seon ^a   Chung, Habong ^b   Shin, Dong Joon ^c  

^a Seoul National University   (South Korea)

^b Hong Ik University   (South Korea)

^c Hanyang University   (South Korea)

Author keywords

Girth; Low density parity check (LDPC) codes; Quasi cyclic (QC) codes

Indexed keywords

CODES (SYMBOLS); MEASUREMENT THEORY; POLYNOMIALS; SET THEORY;

GIRTH; LOW-DENSITY PARITY-CHECK (LDPC) CODES; POLYNOMIAL EQUATIONS; PRIME FIELD; QUASI-CYCLIC CODES;

INFORMATION THEORY;

EID: 33645725165     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.871060     Document Type: Article

References (5)

1. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
2. N. Miladinovic and M. Fossorier, "Systematic recursive construction of LDPC codes," IEEE Commun. Lett., vol. 8, no. 5, pp. 302-304, May 2004.
3. W. W. Peterson and E. J. Weldon Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
4. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
5. R. M. Tanner, D. Sridhara, and T. E. Fuja, "A class of group-structured LDPC codes," in Proc. Int. Symp. Communication Theory and Applications, Ambleside, U.K., Jul. 2001.