作者: F. Cicalese , L. Gargano , U. Vaccaro
关键词: Discrete mathematics 、 Combinatorics 、 Partially ordered set 、 Random number generation 、 Probability distribution 、 Mathematics 、 Parse tree 、 Upper and lower bounds 、 Minimax approximation algorithm 、 Uniform distribution (continuous) 、 Majorization
摘要: In this correspondence, we prove that the probability distribution induced on leaves of a Tunstall parse tree for given source is (unique) lower bound in partially ordered set distributions by all possible trees with same number leaves, and according to majorization partial order. We apply result problem optimally approximating uniform flips biased coin