On the minimum distance of turbo codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 84-

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

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

TRELLIS DIAGRAMS;

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATRIX ALGEBRA; SPECTRUM ANALYSIS; TRELLIS CODES;

TURBO CODES;

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

References (5)

1. Some results concerning the design and decoding of turbo-codes
2. A logarithmic upper bound on the minimum distance of turbo codes
3. Weight distributions for turbo codes using random and nonrandom permutations
4. Interleaver design using backtracking and spreading methods