Grouping-and-shifting designs for structured LDPC codes with large girth

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 236-

  Lu, Jin ^a   Moura, José M F ^a   Niesen, Urs ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECT NODES; DISJOINT GROUPS; FLEXIBLE CODE RATES; LARGE GIRTH;

BIT ERROR RATE; COMPUTER SIMULATION; PARAMETER ESTIMATION; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

CODES (SYMBOLS);

EID: 5044241113     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (2)

1. C. E. Shannon, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533-547, 1981.
2. D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, 1999.