Upper bounds on the rate of LDPC codes

IEEE Transactions on Information Theory

Volumn 48, Issue 9, 2002, Pages 2437-2449

  Burshtein, David ^a,b   Krivelevich, Michael ^b   Litsyn, Simon ^a,b   Miller, Gadi ^b  

^a IEEE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Error probability; Iterative decoding; Low density parity check (LDPC) codes; Maximum likelihood (ML) decoding; Minimum distance

Indexed keywords

ITERATIVE DECODING; LOW-DENSITY PARITY-CHECK CODES; MAXIMUM-LIKELIHOOD DECODING; MINIMUM DISTANCE; UPPER BOUNDS;

ALGORITHMS; DECODING; ERRORS; GRAPH THEORY; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

CODES (SYMBOLS);

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

References (23)

1. Establishing the matching polytope
2. Methods for integer programming: Algebraic, combinatorial and enumerative
3. Near Shannon limit error correcting coding and decoding: Turbo codes
4. Expander graph arguments for message passing algorithms
5. Bounds on the performance of belief propagation decoding
6. Perfect matchings in random r-regular, s-uniform hypergraphs
7. Matchings and covers in hypergraphs
8. The enumeration of arrays and a generalization related to contingency tables
9. On ensembles of low-density parity-check codes: Distance distributions
10. Improved low-density parity-check codes using irregular graphs
11. Good error-correcting codes based on very sparse matrices
12. Construction de suites symétriques
13. Asymptotic theory of finite dimensional normed spaces
14. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
15. Bounds on the maximum likelihood decoding error probability of low density parity check codes
16. The capacity of low-density parity check codes under message-passing decoding
17. Design of capacity-approaching irregular low-density parity-check codes
18. Expander codes
19. Minimum distance bounds by graph analysis
20. Asymptotics and random matrices with row-sum and column-sum restrictions
21. On an estimate of the chromatic class of a p-graph