Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 47, Issue 7, 2001, Pages 2696-2710

  Miller, Gadi ^b   Burshtein, David ^a,b  

^a IEEE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Code ensembles; Error exponent; Low density parity check (LDPC) codes

Indexed keywords

LOW-DENSITY PARITY-CHECK (LDPC) CODES;

CHANNEL CAPACITY; CODING ERRORS; INFORMATION THEORY; PROBABILITY;

BINARY CODES;

EID: 0035504686     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.959254     Document Type: Article

References (13)

1. Near Shanon limit error correcting coding and decoding: Turbo codes
2. On ensembles of low-density parity-check codes: Distance distributions
3. Improved low-density parity-cheek codes using irregular graphs
4. Good error-correcting codes based on very sparse matrices
5. Bounds on the decoding error probability of binary linear codes via their spectra
6. The capacity of low-density parity check codes under message-passing decoding
7. Improved upper bounds on the ensemble performance of ML decoded low density parity check codes
8. Random coding techniques for nonrandom codes
9. Expander Codes
10. Estimation of the error-correction complexity for Gallager low-density codes