A universal scheme for wynerziv coding of discrete sources

Shirin Jalali, Sergio Verdú, Tsachy Weissman

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


We consider the WynerZiv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by LempelZiv (LZ) compression, while the decompressor is based on a modification of the discrete universal denoiser (DUDE) algorithm to take advantage of side information. The new algorithms not only universally attain the fundamental limits, but also suggest a paradigm for practical WZ coding. The effectiveness of our approach is illustrated with experiments on binary images, and English text using a low complexity algorithm motivated by our class of universally optimal WZ codes.

Original languageEnglish (US)
Article number5437417
Pages (from-to)1737-1750
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number4
StatePublished - Apr 2010

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Discrete denoising
  • Rate-distortion function
  • Sliding-window coding
  • Universal algorithm
  • Wyner-Ziv coding


Dive into the research topics of 'A universal scheme for wynerziv coding of discrete sources'. Together they form a unique fingerprint.

Cite this