Recognition: unknown
Informational Divergence and Entropy Rate on Rooted Trees with Probabilities
classification
💻 cs.IT
math.IT
keywords
boundcodedivergenceentropyinformationalprobabilitiesrootedtrees
read the original 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.
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.