555 search results - page 1 / 111 » Polar codes are optimal for lossy source coding |
TIT
2010
12 years 11 months ago
2010
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
ISITA
2010
12 years 11 months ago
2010
We consider the Binary Erasure Source (BES) introduced by Martinian and Yedidia. Based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion p...
DCC
2010
IEEE
13 years 12 months ago
2010
IEEE
It is known that modeling an information source via a symbolic dynamical system evolving over the unit interval, leads to a natural lossless compression scheme attaining the entro...
TIT
2010
12 years 11 months ago
2010
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 dist...