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

Joseph Boutros, Gilles Zémor

Research output: Contribution to journalConference article

2 Citations (Scopus)


The interleavers for turbo codes that yields a minimum distance growing with blocklength were discussed. It was found that the interleaver was essentially chosen at random among a family. The block error rates of turbo codes under the AWGN channel for the pure random interleaver, the S-random were presented. Analysis shows that the bidimensional interleaver size was 400 bits and the constituent convolutional code had a feedback.

Original languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 20 Oct 2004
Externally publishedYes


ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this