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 …

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 …

A simple bound on the probability of decoding error for block codes is derived in closed
form. This bound is based on the bounding techniques developed by Gallager. We obtained …

The performance of maximum-likelihood (ML) decoded binary linear block codes is
addressed via the derivation of tightened upper bounds on their decoding error probability …

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 …

A family of upper bounds to error probabilities of coded systems was recently proposed by
D. Divsalar (see IEEE Communication Theory Workshop, 1999; JPL TMO Prog. Rep. 42 …

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 …

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 …

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 …