Polar codes, introduced recently by Arikan, are the first family of codes known to achieve
capacity of symmetric channels using a low complexity successive cancellation decoder …

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 …

We consider lossy source compression of a binary symmetric source using polar codes and
a low-complexity successive encoding algorithm. It was recently shown by Arikan that polar …

This paper studies the minimum achievable source coding rate as a function of blocklength
n and probability ϵ that the distortion exceeds a given level d. Tight general achievability …

We study the use of low-density generator matrix (LDGM) codes for lossy compression of the
Bernoulli symmetric source. First, we establish rigorous upper bounds on the average …

We describe message-passing and decimation approaches for lossy source coding using
low-density generator matrix (LDGM) codes. In particular, this paper addresses the problem …

We propose a new algorithm for binary quantization based on the Belief Propagation
algorithm with decimation over factor graphs of Low Density Generator Matrix (LDGM) …

We investigate an encoding scheme for lossy compression of a binary symmetric source
based on simple spatially coupled low-density generator-matrix codes. The degree of the …

This thesis explore dynamics in source coding and channel coding. We begin by introducing
the idea of distortion side information, which does not directly depend on the source but …

The basic tradeoff in lossy compression is that between the compression ratio (rate) and the
fidelity of reproduction of the object that is compressed. Traditional (asymptotic) information …