4.5 Article

Non-Asymptotic Bounds of Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 69, Issue 4, Pages 2113-2119

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2022.3229358

Keywords

Codes; Source coding; Distortion; Entropy; Symbols; Rate-distortion; Probability distribution; Cumulant generating function of codeword lengths; excess distortion probability; Renyi entropy; Shannon theory; variable-length lossy source coding

Ask authors/readers for more resources

This paper investigates variable length source coding with criteria of normalized cumulant generating function of codeword lengths and excess distortion probability. It analyzes the non-asymptotic fundamental limit of normalized cumulant generating function of codeword lengths under the constraint that excess distortion probability is allowed up to e ? [0, 1). The non-asymptotic achievability and converse bounds are characterized by the quantity related to Renyi entropy.
This paper investigates the problem of variable length source coding with the criteria of the normalized cumulant generating function of codeword lengths and the excess distortion probability. We analyze the non-asymptotic fundamental limit of the normalized cumulant generating function of codeword lengths under the constraint that the excess distortion probability is allowed up to e ? [0, 1). Our non-asymptotic achievability and converse bounds are characterized by the quantity related to the Renyi entropy.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available