The two central topics of information theory are the compression and the transmission of
data. Shannon, in his seminal work, formalized both these problems and determined their …

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density
parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using …

We show that duals of certain low-density parity-check (LDPC) codes, when used in a
standard coset coding scheme, provide strong secrecy over the binary erasure wiretap …

Motivated by the significant performance gains which polar codes experience under
successive cancellation list decoding, their scaling exponent is studied as a function of the …

The growing demand for ubiquitous wireless communication services requires powerful
coding and modulation schemes to counteract the signal degradation in the air interface …

Wireless communication systems have greatly advanced during the last years. A significant
contributor in these systems' performance has been Orthogonal Frequency Division …

Modern codes are often designed to attain the minimum possible error probability under a
blocklength constraint. For instance, sparse-graph codes are often designed aiming for large …

The subject of this paper is transmission over a general class of binary-input memoryless
symmetric channels using error correcting codes based on sparse graphs, namely, low …

This thesis deals with the asymptotic analysis of coding systems based on sparse graph
codes. The goal of this work is to analyze the decoder performance when transmitting over a …

Recent developments in decoding Tanner codes with maximum-likelihood certificates are
based on a sufficient condition called local optimality. We define hierarchies of locally …