Contradicting a myth: Good turbo codes with large memory order

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2000, Pages 122-

  Massey, P C ^a   Takeshita, O Y ^a   Costello D J , Jr ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FRAME ERROR RATE;

ALGORITHMS; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; SIGNAL TO NOISE RATIO; TRELLIS CODES;

TURBO CODES;

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

References (3)

1. Near Shannon limit error-correcting coding and decoding: Turbo-codes
2. Optimal decoding of linear codes for minimizing symbol error rate
3. Coding theorems for 'turbo-like' codes