2000 character limit reached
Sharp Bounds Between Two Rényi Entropies of Distinct Positive Orders
Published 29 Apr 2016 in cs.IT and math.IT | (1605.00019v2)
Abstract: Many axiomatic definitions of entropy, such as the R\'enyi entropy, of a random variable are closely related to the -norm of its probability distribution. This study considers probability distributions on finite sets, and examines the sharp bounds of the -norm with a fixed -norm, , for -dimensional probability vectors with an integer . From the results, we derive the sharp bounds of the R\'enyi entropy of positive order with a fixed R\'enyi entropy of another positive order . As applications, we investigate sharp bounds of Ariomoto's mutual information of order and Gallager's random coding exponents for uniformly focusing channels under the uniform input distribution.
Paper Prompts
Sign up for free to create and run prompts on this paper.