Non-asymptotic covering lemmas

Author

Verdu, Sergio

Author_Institution

Princeton Univ., Princeton, NJ, USA

fYear

2015

fDate

April 26 2015-May 1 2015

Firstpage

1

Lastpage

3

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

information theory; asymptotic fundamental limits; discrete memoryless systems; information theory; nonasymptotic covering lemmas; single-shot approach; Channel coding; Memoryless systems; Mutual information; Propagation losses; Random variables; 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;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop (ITW), 2015 IEEE

Conference_Location

Jerusalem

Print_ISBN

978-1-4799-5524-4

Type

conf

DOI

10.1109/ITW.2015.7133173

Filename

7133173