@inproceedings{81f93cd1ed0f4878b09bd20d504c2c21,
title = "Nonasymptotic noisy lossy source coding",
abstract = "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.",
keywords = "Achievability, Shannon theory, converse, dispersion, finite blocklength regime, lossy data compression, memoryless sources, noisy source coding, strong converse",
author = "Victoria Kostina and Sergio Verd{\'u}",
year = "2013",
doi = "10.1109/ITW.2013.6691295",
language = "English (US)",
isbn = "9781479913237",
series = "2013 IEEE Information Theory Workshop, ITW 2013",
booktitle = "2013 IEEE Information Theory Workshop, ITW 2013",
note = "2013 IEEE Information Theory Workshop, ITW 2013 ; Conference date: 09-09-2013 Through 13-09-2013",
}