Interleavers for turbo codes that yield a minimum distance growing with blocklength

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 55-

  Boutros, Joseph ^a   Zémor, Gilles ^a  

^a TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODEWORDS; INTERLEAVERS; QUASI-CYCLIC TURBO CODES; UNSTRUCTURED PERMUTATION;

CHANNEL CAPACITY; CONVOLUTION; ERROR ANALYSIS; INFORMATION ANALYSIS; POLYNOMIALS; RANDOM PROCESSES;

TURBO CODES;

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

References (4)

1. M. Breiling, "A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes," http://www.lnt.de/~breiling/Research/Publications/
2. D. Divsalar, F. Pollara, "Turbo codes for PCS applications," IEEE International Conference on Communications, vol. 1, pp. 54-59, Seattle, June 1995.
3. R. M. Tanner, "Toward an Algebraic Theory for Turbo Codes," in Proc. 2nd Int. Symp. on Turbo Codes, Brest, Sept. 2000.
4. D. Truhachev, M. Lentmaier, K. Zigangirov, "Some results concerning design and decoding of turbo-codes," Problems of Information Transmission, vol. 37, no. 3, pp. 190-205, 2001.