The goal of this article is to describe the main ideas behind the new class of codes called
turbo codes, whose performance in terms of bit error probability has been shown to be very …

Recently, a coding scheme termed turbo-codes was proposed which achieves results very
close to the Shannon-limit. The encoding and decoding of these codes is reviewed. We …

We provide an overview of the novel class of channel codes referred to as turbo codes,
which have been shown to be capable of performing close to the Shannon limit. We …

For understanding turbo codes, we propose to locate them at the intersection of three main
topics: the random-like criterion for designing codes, the idea of extending the decoding role …

Turbo-codes have attracted a great deal of interest since their discovery in 1993. This paper
reviews the reasons for this, in particular their attainment of the ultimate limits of the capacity …

This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from
a particular concatenation of two recursive systematic codes, linked together by nonuniform …

L'invention des turbocodes au début des années 90 a véritablement bouleversé le champ
du codage correcteur d'erreur. Des codes relativement simples à construire et à décoder …

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 introduce multiple turbo codes and a suitable decoder structure derived from an
approximation to the maximum a posteriori probability (MAP) decision rule, which is …

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 …