Asymptotic Expansions of Smooth Rényi Entropies and Their Applications

03/11/2020
by   Yuta Sakai, et al.
0

This study considers the unconditional smooth Rényi entropy, the smooth conditional Rényi entropy proposed by Kuzuoka [IEEE Trans. Inf.Theory, vol. 66, no. 3, pp. 1674–1690, 2020], and a new quantity which we term the conditional smooth Rényi entropy. In particular, we examine asymptotic expansions of these entropies when the underlying source with its side-information is stationary and memoryless. Using these smooth Rényi entropies, we establish one-shot coding theorems of several information-theoretic problems: Campbell's source coding, guessing problems, and task encoding problems, all allowing errors. In each problem, we consider two error formalisms: the average and maximum error criteria, where the averaging and maximization are taken with respect to the side-information of the source. Applying our asymptotic expansions to the derived one-shot coding theorems, we derive various asymptotic fundamental limits for these problems when their error probabilities are allowed to be non-vanishing. We show that, in non-degenerate settings, the first-order fundamental limits differ under the average and maximum error criteria. This is in contrast to a different but related setting considered by the present authors (for variable-length conditional source coding allowing errors) in which the first-order terms are identical but the second-order terms are different under these criteria.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
10/22/2018

On the Conditional Smooth Renyi Entropy and its Applications in Guessing and Source Coding

A novel definition of the conditional smooth Renyi entropy, which is dif...
research
07/21/2023

Soft Guessing Under Log-Loss Distortion Allowing Errors

This paper deals with the problem of soft guessing under log-loss distor...
research
12/26/2020

Are Guessing, Source Coding, and Tasks Partitioning Birds of a Feather?

This paper establishes a close relationship among the four information t...
research
07/10/2020

Third-Order Asymptotics of Variable-Length Compression Allowing Errors

This study investigates the fundamental limits of variable-length compre...
research
08/19/2018

Non-Asymptotic and Asymptotic Fundamental Limits of Guessing Subject to Distortion

This paper considers the problem of guessing random variables subject to...
research
05/21/2020

An Importance Aware Weighted Coding Theorem Using Message Importance Measure

There are numerous scenarios in source coding where not only the code le...

Please sign up or login with your details

Forgot password? Click here to reset