We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes,
that are capacity-approaching on a binary erasure channel (BEC) with bounded encoding …

Research into applying LDPC code theory, which is used for channel coding, to source
coding has received a lot of attention in several research fields such as distributed source …

A systematic construction of capacity achieving low-density parity-check (LDPC) code
ensemble sequences over the Binary Erasure Channel (BEC) has been proposed by …

This paper is concerned with a simple binary erasure-recovery coding scheme that falls into
the family of so-called semi-random low-density-parity-check (SR-LDPC) codes. Based on a …

Khandekar and McEliece suggested the problem of per bit decoding complexity for capacity
achieving sparse-graph codes as a function of their gap from the channel capacity. We …

The decoding error probability of codes is studied as a function of their block length. It is
shown that the existence of codes with a polynomially small decoding error probability …

This paper analyzes the outage performance of soft-cancellation frequency-domain
minimum-mean-square error (SC FD-MMSE) turbo equalization in a serially concatenated …

The energy complexity of error control coding circuits is analyzed within the Thompson VLSI
model. It is shown that fully-parallel encoding and decoding schemes with asymptotic block …

In this paper, the average input-parity weight enumerator (AIPWE) of regular/irregular repeat-
accumulate (RA) ensembles is derived, by viewing an RA code as a serial concatenation of …

Lossless data transfer over communication networks has traditionally been achieved by
means of ARQ protocols. However, the last ten years have seen an increasing interest in …