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 …

An optimal interleaving between two component encoders of a turbo-code is proposed. For
any real constructable interleaver the optimality criterion is given. For component codes …

An upper bound on the minimum distance of turbo codes is derived, which depends only on
the interleaver length and the component scramblers employed. The derivation of this bound …

In this article, we design new turbo codes that can achieve near-Shannon-limit performance.
The design criterion for random interleavers is based on maximizing the effective free …

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 …

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 instead of the standard union …

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 …

The authors define and study the effective free distance of a turbo code. If a turbo code is
constructed from a number of component codes, they argue that the effective free distance …

Parallel concatenated coding schemes employing convolutional codes as constituent codes
linked by an interleaver have been proposed in the literature as 'turbo codes'. They yield …

We evaluate the variance of the union performance bound for a rate-1/3 turbo code over all
possible interleavers of length N, under the assumption of a maximum-likelihood (ML) …