Non-asymptotic covering lemmas

Sergio Verdú

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

2 Scopus citations


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.

Original languageEnglish (US)
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479955268
StatePublished - Jun 24 2015
Event2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel
Duration: Apr 26 2015May 1 2015

Publication series

Name2015 IEEE Information Theory Workshop, ITW 2015


Other2015 IEEE Information Theory Workshop, ITW 2015

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Information Systems
  • Computational Theory and Mathematics


  • 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


Dive into the research topics of 'Non-asymptotic covering lemmas'. Together they form a unique fingerprint.

Cite this