No title
In this paper we investigate the typical behaviour of minimum distance and ML word error probability of a serial turbo concatenation with random interleaver, when the interleaver length N goes to infinity. Our main result shows that the word error probability P(e) goes to zero subexponentially in N with probability one. While it is known that 10glE[P(e)]/logN converges to a constant, we prove that
