On ensembles of low-density parity-check codes: Asymptotic distance distributions

IEEE Transactions on Information Theory

Volumn 48, Issue 4, 2002, Pages 887-908

  Litsyn, Simon ^a,b   Shevelev, Vladimir ^c  

^a IEEE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distance distributions; Low density parity check codes(LDPC)

Indexed keywords

PARITY-CHECK CODES;

ALGORITHMS; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; PROBABILITY; THEOREM PROVING;

CODES (SYMBOLS);

EID: 0036539259     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.992777     Document Type: Article

References (14)

1. Asymptotic analysis of a random walk on a hypercube with many dimensions
2. The enumeration of arrays and a generalization related to contingency tables
3. Random walk and the theory of Brownian motion
4. A survey of binary Krawtchouk polynomials
5. Good error-correcting codes based on very sparse matrices
6. Bounds on the maximum likelihood decoding error probability of low density parity check codes
7. Asymptotics and random matrices with row-sum and column-sum restrictions
8. Improved upper bounds on the ensemble performance of ML decoded low density parity check codes
9. The capacity of low-density parity check codes under message-passing decoding