The performance of serial turbo codes does not concentrate
Abstract in UndeterminedMinimum distances and maximum likelihood error probabilities of serial turbo codes with uniform interleaver are analyzed. It is shown that, for a fraction of interleavers approaching one as the block-length grows large, the minimum distance of serial turbo codes grows as a positive power of their block-length, while their error probability decreases exponentially fast in so
