This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles
of parallel and serial turbo codes are" good" in the following sense. For a turbo code …

In this paper we discuss AWGN coding theorems for ensembles of coding systems which are
built from fixed convolutional codes interconnected with random interleavers. We call these …

An optimal interleaving between two component encoders of a turbo‐code is proposed. The
optimally criterion for any real constructable interleaver is given. For component codes with …

Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit
Shannon established some 50 years ago. We look at the performance of turbo-codes with …

We analyze the asymptotic performance of punctured turbo codes. The analysis is based on
the union bound on the word error probability of maximum likelihood decoding for punctured …

We derive a new upper bound on the word-and bit-error probabilities of turbo codes with
maximum-likelihood decoding by using the Gallager bound. Since the derivation of the …

The transmission of coded communication systems is widely modeled to take place over a
set of parallel channels. This model is used for transmission over block-fading channels, rate …

We prove the existence of thresholds for turbo codes and we prove concentration of the
performance of turbo codes within the ensemble determined by the random interleaver. In …

While improved bounds have been central to proofs of the coding theorem and the tightness
of the random coding bound for rates near capacity, most results for specific codes, both …

We derive here improved upper bounds on the decoding error probability of block codes
which are transmitted over fully interleaved Rician fading channels, coherently detected and …