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

Information theory and inference, often taught separately, are here united in one entertaining
textbook. These topics lie at the heart of many exciting areas of contemporary science and …

Algorithms that must deal with complicated global functions of many variables often exploit
the manner in which the given functions factor as a product of" local" functions, each of …

Concatenation is a method of building long codes out of shorter ones; it attempts to meet the
problem of decoding complexity by breaking the required computation into manageable …

Graphical models such as factor graphs allow a unified approach to a number of key topics
in coding and signal processing such as the iterative decoding of turbo codes, LDPC codes …

We investigate spatially coupled code ensembles. For transmission over the binary erasure
channel, it was recently shown that spatial coupling increases the belief propagation …

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 …

In this paper, we are concerned with the finite-length analysis of low-density parity-check
(LDPC) codes when used over the binary erasure channel (BEC). The main result is an …

A generalized state realization of the Wiberg (1996) type is called normal if symbol variables
have degree 1 and state variables have degree 2. A natural graphical model of such a …

Extrinsic information transfer (EXIT) charts are a tool for predicting the convergence behavior
of iterative processors for a variety of communication problems. A model is introduced that …