Non-Asymptotic Bounds for Fixed-Length Lossy Compression

被引：0
|
作者：
Matsuta, Tetsunao [1 ]
Uyematsu, Tomohiko [1 ]
机构：
[1] Tokyo Inst Technol, Dept Commun & Comp Engn, Meguro Ku, 2-12-1 Ookayama, Tokyo 1528550, Japan
来源：
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2015年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we deal with the fixed-length lossy compression with the epsilon-fidelity criterion which is a kind of the distortion criterion such that the probability of exceeding a given distortion level is less than a given probability level. We give an achievability bound and a converse bound of the minimum number of codewords with this criterion. We show that our converse bound is tighter than that of Kostina and Verdu. We also show a numerical example which demonstrates that there exists some cases where our achievability bound is tighter than that of Kostina and Verdu.
引用
收藏
页码：1811 / 1815
页数：5
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] Universality of Logarithmic Loss in Fixed-Length Lossy Compression
    No, Albert
    [J]. ENTROPY, 2019, 21 (06)
  • [4] 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
  • [5] Fixed-Length Lossy Compression in the Finite Blocklength Regime
    Kostina, Victoria
    Verdu, Sergio
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 3309 - 3338
  • [6] Fixed-length lossy compression in the finite blocklength regime: Gaussian source
    Kostina, Victoria
    Verdu, Sergio
    [J]. 2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,
  • [7] Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints
    Sason, Igal
    Verdu, Sergio
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2211 - 2215
  • [8] Fixed-length lossy compression in the finite blocklength regime: discrete memoryless sources
    Kostina, Victoria
    Verdu, Sergio
    [J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 41 - 45
  • [9] Variable-length Lossy Compression and Channel Coding: Non-asymptotic Converses via Cumulant Generating Functions
    Courtade, Thomas A.
    Verdu, Sergio
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2499 - 2503
  • [10] Non-asymptotic bounds for autoregressive approximation
    Goldenshluger, A
    Zeevi, A
    [J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 304 - 304
12345