Turbo codes and Shannon's condition for reliable communication

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 442-

  Lentmaier, Michael ^a   Truhachev, Dmitri V ^b   Zigangirov, Kamil Sh ^a   Costello Jr , Daniel J ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYMBOLS; LOG-LIKELYHOOD RATIOS (LLR); NOISY COMMUNICATION CHANNELS;

BIT ERROR RATE; CHANNEL CAPACITY; DECODING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MAXIMUM LIKELIHOOD ESTIMATION; MONTE CARLO METHODS; PARAMETER ESTIMATION; THEOREM PROVING; TURBO CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 5044246386     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1451-1461, June 2002.
2. M. Lentmaier, D. V. Truhachev, K. S. Zigangirov, and D. J. Costello, Jr., "An analysis of the block error probability performance of iterative decoding," submitted to IEEE Trans. Inform. Theory, April 2004.
3. T. Richardson and R. Urbanke, "Thresholds for turbo codes," in Proc. ISIT 2000, Sorrento, Italy, June 2000, p. 317.