Two approaches to the analysis of low-density parity-check codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 29-

  Zigangirov, Kamil Sh ^a   Lentmaier, Michael ^a   Truhachev, Dmitri ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

LOW-DENSITY PARITY-CHECK (LDPC) CODES;

ALGORITHMS; BINARY CODES; DECODING; ERROR CORRECTION; ITERATIVE METHODS; PROBABILITY DENSITY FUNCTION; SIGNAL TO NOISE RATIO; THEOREM PROVING;

TURBO CODES;

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

References (7)

1. Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes
2. Some Results Concerning Design and Decoding of Turbo Codes
3. The Capacity of Low-Density Parity-Check Codes under Message-Passing Decoding
4. On the Theory of Low-Density Convolutional Codes II
5. A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes