Third-Order Asymptotics of Variable-Length Compression Allowing Errors

07/10/2020
by   Yuta Sakai, et al.
0

This study investigates the fundamental limits of variable-length compression in which prefix-free constraints are not imposed (i.e., one-to-one codes are studied) and non-vanishing error probabilities are permitted. Due in part to a crucial relation between the variable-length and fixed-length compression problems, our analysis requires a careful and refined analysis of the fundamental limits of fixed-length compression in the setting where the error probabilities are allowed to approach either zero or one polynomially in the blocklength. To obtain the refinements, we employ tools from moderate deviations and strong large deviations. Finally, we provide the third-order asymptotics for the problem of variable-length compression with non-vanishing error probabilities. We show that unlike several other information-theoretic problems in which the third-order asymptotics are known, for the problem of interest here, the third-order term depends on the permissible error probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2018

The Optimal Compression Rate of Variable-to-Fixed Length Source Coding with a Non-Vanishing Excess-Distortion Probability

We consider the variable-to-fixed length lossy source coding (VFSC) prob...
research
07/05/2017

Estimating the Fundamental Limits is Easier than Achieving the Fundamental Limits

We show through case studies that it is easier to estimate the fundament...
research
10/13/2019

Variable-Length Source Dispersions Differ under Maximum and Average Error Criteria

Variable-length compression without prefix-free constraints and with sid...
research
03/11/2020

Asymptotic Expansions of Smooth Rényi Entropies and Their Applications

This study considers the unconditional smooth Rényi entropy, the smooth ...
research
09/05/2023

Topologies for Error-Detecting Variable-Length Codes

Given a finite alphabet A, a quasi-metric d over A^*, and a non-negative...
research
07/01/2021

Data Deduplication with Random Substitutions

Data deduplication saves storage space by identifying and removing repea...
research
12/30/2019

A New Burrows Wheeler Transform Markov Distance

Prior work inspired by compression algorithms has described how the Burr...

Please sign up or login with your details

Forgot password? Click here to reset