Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints

被引：0
|
作者：
Sason, Igal [1 ]
Verdu, Sergio [2 ]
机构：
[1] Technion Israel Inst Technol, Andrew & Erna Viterbi Fac Elect Engn, IL-32000 Haifa, Israel
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
来源：
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2018年
关键词：
Cumulant generating function; lossless source coding; Renyi information measures; LENGTH;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Bounds on optimal guessing moments serve to improve non-asymptotic bounds on the cumulant generating function of the codeword lengths for fixed-to-variable optimal lossless source coding without prefix constraints. Non-asymptotic bounds on the reliability function of discrete memoryless sources are presented as well. Lower bounds on the cumulant generating function of the codeword lengths are given, by means of the smooth Renyi entropy, for source codes that allow decoding errors.
引用
收藏
页码：2211 / 2215
页数：5
相关论文
共 13 条
  • [1] Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints
    Szpankowski, Wojciech
    Verdu, Sergio
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (07) : 4017 - 4025
  • [2] Non-Asymptotic Bounds for Fixed-Length Lossy Compression
    Matsuta, Tetsunao
    Uyematsu, Tomohiko
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1811 - 1815
  • [3] Minimum Expected Length of Fixed-to-Variable Lossless Compression of Memoryless Sources
    Szpankowski, Wojciech
    Verdu, Sergio
    [J]. 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 369 - +
  • [4] Optimal Non-Asymptotic Bounds for the Sparse β Model
    Yang, Xiaowei
    Pan, Lu
    Cheng, Kun
    Liu, Chao
    [J]. MATHEMATICS, 2023, 11 (22)
  • [5] New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression
    Matsuta, Tetsunao
    Uyematsu, Tomohiko
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (12): : 2116 - 2129
  • [6] Non-asymptotic confidence bounds for the optimal value of a stochastic program
    Guigues, Vincent
    Juditsky, Anatoli
    Nemirovski, Arkadi
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2017, 32 (05): : 1033 - 1058
  • [7] Non-Asymptotic Bounds of Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression
    Saito, Shota
    Matsushima, Toshiyasu
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (04) : 2113 - 2119
  • [8] Non-Asymptotic Bounds on Fixed Length Source Coding for Markov Chains
    Hayashi, Masahito
    Watanabe, Shun
    [J]. 2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 875 - 882
  • [9] Non-Asymptotic Delay Bounds for Multi-Server Systems with Synchronization Constraints
    Fidler, Markus
    Walker, Brenton
    Jiang, Yuming
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (07) : 1545 - 1559
  • [10] Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints
    Roberto I. Oliveira
    Philip Thompson
    [J]. Mathematical Programming, 2023, 199 : 1 - 48
12