Nonasymptotic noisy lossy source coding

Victoria Kostina, Sergio Verdú

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is asymptotically equivalent to a noiseless lossy source coding problem with a modified distortion function, nonasymptotically there is a difference in how fast their minimum achievable coding rates approach the rate-distortion function, providing yet another example where at finite blocklengths one must put aside traditional asymptotic thinking.

Original languageEnglish (US)
Title of host publication2013 IEEE Information Theory Workshop, ITW 2013
StatePublished - 2013
Event2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain
Duration: Sep 9 2013Sep 13 2013

Publication series

Name2013 IEEE Information Theory Workshop, ITW 2013


Other2013 IEEE Information Theory Workshop, ITW 2013

All Science Journal Classification (ASJC) codes

  • Information Systems


  • Achievability
  • Shannon theory
  • converse
  • dispersion
  • finite blocklength regime
  • lossy data compression
  • memoryless sources
  • noisy source coding
  • strong converse


Dive into the research topics of 'Nonasymptotic noisy lossy source coding'. Together they form a unique fingerprint.

Cite this