We introduce a new approach to proving that a sequence of deterministic linear codes
achieves capacity on an erasure channel under maximum a posteriori decoding. Rather …

In the group testing problem, which goes back to the work of Dorfman (1943), we aim to
identify a small set of $ k\sim n^\theta $ infected individuals out of a population size $ n …

We consider the estimation of a signal from the knowledge of its noisy linear random
Gaussian projections. A few examples where this problem is relevant are compressed …

This paper provides an overview on the rationales in incorporating massive multiple-input
multiple-output (MIMO), non-orthogonal multiple access (NOMA), and interleave division …

We consider the estimation of a signal from the knowledge of its noisy linear random
Gaussian projections, a problem relevant in compressed sensing, sparse superposition …

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as
LDPC convolutional codes, have been shown to exhibit excellent performance under low …

Since the discovery of turbo codes 20 years ago and the subsequent rediscovery of low-
density parity check codes a few years later, the field of channel coding has experienced a …

Challenges and some new directions in channel coding Page 1 328 JOURNAL OF
COMMUNICATIONS AND NETWORKS, VOL. 17, NO. 4, AUGUST 2015 Challenges and …

Low-density parity-check (LDPC) convolutional codes (or spatially coupled codes) were
recently shown to approach capacity on the binary erasure channel (BEC) and binary-input …

Error correction coding (ie, channel coding) is a key ingredient of any digital
communications system. In mobile wireless communications, channel codes have evolved …