加载中…
It is well known that the entropy of a discrete random variable is always greater than or equal to the entropy of a function of , with equality if and only if is one-to-one. In this paper, we give tight bounds on when the function is not one-to-one, and we illustrate a few scenarios where this matters. As an intermediate step towards our main result, we derive a lower bound on the entropy of a probability distribution, when only a bound on the ratio between the maximal and minimal probabilities is known. The lower bound improves on previous results in the literature, and it could find applications outside the present scenario.

生成讲解博客的中文版本

生成AI智能校验的中文版本