Performance limits of concatenated codes with iterative decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2000, Pages 150-

  Vialle, Sandrine ^a   Boutros, Joseph ^b  

^a Motorola Labs   (France)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

A POSTERIORI PROBABILITY; CONCATENATED CODES; DENSITY PROPAGATION; ITERATIVE DECODING;

BIT ERROR RATE; CONVOLUTIONAL CODES; DECODING; GRAPH THEORY; MONTE CARLO METHODS; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; SIGNAL TO NOISE RATIO;

BLOCK CODES;

EID: 0034447819     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2000.866442     Document Type: Article

References (8)

1. Low-density parity-check codes
2. A recursive approach to low complexity codes
3. Near shannon limit error-correcting coding and decoding: Turbo-codes
4. Serial concatenation of interleaved codes: Performance analysis, design and iterative decoding
5. A Gallager-Tanner construction based on convolutional codes
6. Generalized low density (Tanner) codes
7. Time varying periodic convolutional codes with low-density-parity-check matrix
8. The capacity of low-density parity check codes under message-passing decoding