Non-Asymptotic Covering Lemmas

被引:0
|
作者
Verdu, Sergio [1 ]
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
关键词
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.
引用
收藏
页数:3
相关论文
共 50 条
  • [41] Non-asymptotic confidence ellipsoids for the least squares estimate
    Weyer, E
    Campi, MC
    PROCEEDINGS OF THE 39TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 2000, : 2688 - 2693
  • [42] Non-asymptotic and Accurate Learning of Nonlinear Dynamical Systems
    Sattar, Yahya
    Oymak, Samet
    JOURNAL OF MACHINE LEARNING RESEARCH, 2022, 23
  • [43] Second Law of Entanglement Dynamics for the Non-Asymptotic Regime
    Wilde, Mark M.
    2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [44] Non-Asymptotic Guarantees for Sampling by Stochastic Gradient Descent
    A. G. Karagulyan
    Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences), 2019, 54 : 71 - 78
  • [45] On optimizing non-asymptotic throughput of wireless mesh networks
    Zhou, Ping
    Manoj, B. S.
    Rao, Ramesh
    2008 5TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, 2008, : 343 - 347
  • [46] Multiscale Dictionary Learning: Non-Asymptotic Bounds and Robustness
    Maggioni, Mauro
    Minsker, Stanislav
    Strawn, Nate
    JOURNAL OF MACHINE LEARNING RESEARCH, 2016, 17
  • [47] Non-Asymptotic Analysis for Relational Learning with One Network
    He, Peng
    Zhang, Changshui
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 33, 2014, 33 : 320 - 327
  • [48] Non-asymptotic fuzzy estimators based on confidence intervals
    Sfiris, D. S.
    Papadopoulos, B. K.
    INFORMATION SCIENCES, 2014, 279 : 446 - 459
  • [49] New Non-asymptotic Random Channel Coding Theorems
    Yang, En-hui
    Meng, Jin
    2013 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2013,
  • [50] Non-asymptotic effects in the photon-pomeron coupling
    Jenkovszky, LL
    Martynov, ES
    Paccanoni, F
    NUOVO CIMENTO DELLA SOCIETA ITALIANA DI FISICA A-NUCLEI PARTICLES AND FIELDS, 1997, 110 (06): : 649 - 658