A. note on approximation of uniform distributions from variable-to-fixed length codes
In this correspondence, we prove that the probability distribution induced on the leaves of a Tunstall parse tree for a given source is a (unique) lower bound in the partially ordered set of the probability distributions induced by all possible parse trees with a same number of leaves, and ordered according to the majorization partial order. We apply this result to the problem of optimally approximating a uniform distribution with flips of a biased coin.
majorization random number generation timstall codes viriable-to-fixed length codes