@inproceedings{5cbae5d9bf734b549e305a3e225ad54e,
title = "Non-asymptotic covering lemmas",
abstract = "In information theory, the packing and covering lemmas are conventionally used in conjunction with the typical sequence approach in order to prove the asymptotic achievability results for discrete memoryless systems. In contrast, the single-shot approach in information theory provides non-asymptotic achievability and converse results, which are useful to gauge the backoff from the asymptotic fundamental limits due to fixed blocklength, and which do not rely on discrete/memoryless assumptions. This paper reviews the non-asymptotic covering lemmas we have obtained recently and their application in single-user and multiuser information theory.",
keywords = "Shannon theory, Wyner-Ziv compression, achievability, almost-lossless compression with a helper, broadcast channels, data transmission with encoder side information, finite blocklength Regime, lossy compression, random coding",
author = "Sergio Verd{\'u}",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE Information Theory Workshop, ITW 2015 ; Conference date: 26-04-2015 Through 01-05-2015",
year = "2015",
month = jun,
day = "24",
doi = "10.1109/ITW.2015.7133173",
language = "English (US)",
series = "2015 IEEE Information Theory Workshop, ITW 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2015 IEEE Information Theory Workshop, ITW 2015",
address = "United States",
}