This article is focused on the performance evaluation of linear codes under optimal
maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively …

We report the empirical performance of Gallager's low density parity check codes on
Gaussian channels. We show that performance substantially better than that of standard …

We study two families of error-correcting codes defined in terms of very sparse matrices."
MN"(MacKay-Neal (1995)) codes are recently invented, and" Gallager codes" were first …

Building on the success of the first edition, which offered a practical introductory approach to
the techniques of error concealment, this book, now fully revised and updated, provides a …

We construct new families of error-correcting codes based on Gallager's (1973) low-density
parity-check codes. We improve on Gallager's results by introducing irregular parity-check …

We describe the close connection between the now celebrated iterative turbo decoding
algorithm of Berrou et al.(1993) and an algorithm that has been well known in the artificial …

A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed.
This list-decoding algorithm is algebraic in nature and builds upon the interpolation …

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 …

This book grew out of our research, industry consulting and con tinuing education courses.
Turbo coding initially seemed to belong to a restricted research area, while now has become …

This article takes a preliminary look at the weight distributions achievable for turbo codes
using random, nonrandom, and semirandom permutations. Due to the recursiveness of the …