Shannon theory;
achievability;
finite blocklength regime;
random coding;
lossy compression;
Wyner-Ziv compression;
broadcast channels;
data transmission with encoder side information;
almost-lossless compression with a helper;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
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.
机构:
Univ New S Wales ADFA, Sch Aerospace Civil & Mech Engn, Canberra, ACT 2600, AustraliaUniv New S Wales ADFA, Sch Aerospace Civil & Mech Engn, Canberra, ACT 2600, Australia
机构:
Univ Paris 11, Equipe Probabil Stat & Modelisat, Math Lab, UMR 8628,Ctr Orsay, F-91405 Orsay, FranceUniv Paris 11, Equipe Probabil Stat & Modelisat, Math Lab, UMR 8628,Ctr Orsay, F-91405 Orsay, France
Massart, P
European Congress of Mathematics,
2005,
: 309
-
323