Irregular progressive edge-growth (PEG) Tanner graphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 480-

  Hu, Xiao Yu ^a   Eleftheriou, Evangelos ^a   Arnold, Dieter Michael ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

TANNER GRAPHS;

ALGORITHMS; COMPUTER SIMULATION; MONTE CARLO METHODS; OPTIMIZATION; TREES (MATHEMATICS);

CODES (SYMBOLS);

EID: 0036353603     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. A recursive approach to low complexity codes
2. Progressive edgegrowth Tanner graphs
3. Improved low-density parity-check codes using irregular graphs
4. Design of capacity-approaching irregular low-density parity-check codes