Expander graph arguments for message-passing algorithms

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 782-790

  Burshtein, D ^a   Miller, G ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Belief propagation; Expander graph; Iterative decoding; Low density parity check (LDPC) codes

Indexed keywords

ALGORITHMS; CODING ERRORS; GRAPH THEORY; ITERATIVE METHODS;

BELIEF PROPAGATION; EXPANDER GRAPHS; ITERATIVE DECODING; MESSAGE PASSING;

DECODING;

EID: 0035246481     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910588     Document Type: Article

References (11)

1. Analysis of low density codes and improved designs using irregular graphs
2. Good error-correcting codes based on very sparse matrices
3. Bounds on the maximum likelihood decoding error probability of low density parity check codes
4. The capacity of low-density parity-check codes under message-passing decoding
5. Design of provably good low-density parity-check codes
6. Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A
7. Expander codes
8. Near Shanon limit error correcting coding and decoding: Turbo codes