On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors
Information Theory
2015-12-22 v1 math.IT
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.
Keywords
Cite
@article{arxiv.1512.06499,
title = {On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors},
author = {Shigeaki Kuzuoka},
journal= {arXiv preprint arXiv:1512.06499},
year = {2015}
}
Comments
19 pages