Informational Divergence and Entropy Rate on Rooted Trees with Probabilities
Information Theory
2013-10-11 v1 math.IT
Abstract
Rooted trees with probabilities are used to analyze properties of a variable length code. A bound is derived on the difference between the entropy rates of the code and a memoryless source. The bound is in terms of normalized informational divergence. The bound is used to derive converses for exact random number generation, resolution coding, and distribution matching.
Keywords
Cite
@article{arxiv.1310.2882,
title = {Informational Divergence and Entropy Rate on Rooted Trees with Probabilities},
author = {Georg Böcherer and Rana Ali Amjad},
journal= {arXiv preprint arXiv:1310.2882},
year = {2013}
}
Comments
5 pages. With proofs and illustrating example