Convolutional low-density parity-check (LDPC) ensembles, introduced by Felström and
Zigangirov, have excellent thresholds and these thresholds are rapidly increasing functions …

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

In this paper, we construct protograph-based spatially coupled low-density parity-check
(LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner …

An iterative decoding threshold analysis for terminated regular LDPC convolutional
(LDPCC) codes is presented. Using density evolution techniques, the convergence behavior …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent
performance with low encoding and decoding complexity. In this paper, we discuss several …

Spatially coupled codes have been of interest recently owing to their superior performance
over memoryless binary-input channels. The performance is good both asymptotically, since …

Recently, it was observed that spatially-coupled LDPC code ensembles approach the
Shannon capacity for a class of binary-input memoryless symmetric (BMS) channels. The …

Low-density parity-check (LDPC) convolutional codes have been shown to be capable of
achieving capacity-approaching performance with iterative message-passing decoding. In …

Absorbing sets are combinatorially defined objects existing in the Tanner graph of a low-
density parity-check (LDPC) code that have been shown to cause failures in the iterative …