On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors
classification
💻 cs.IT
math.IT
keywords
allowingcodewordcodingentropyerrorsexponentiallengthmoment
read the original abstract
In this paper, we consider the problem of variable-length source coding allowing errors. The exponential moment of the codeword length is analyzed in the non-asymptotic regime and in the asymptotic regime. Our results show that the smooth Renyi entropy characterizes the optimal exponential moment of the codeword length.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.