Second order lower bounds for the entropy function expressed in terms of the index of coincidence are derived. Equivalently, these bounds involve entropy and Rényi entropy of order 2. The constants found either explicitly or implicitly are best possible in a natural sense. The inequalities developed originated with certain problems in universal prediction and coding which are briefly discussed.

The definition of weighted entropy allows for easy calculation of the entropy of the mixture of measures. In this paper we investigate the problem of equivalent definition of the general entropy function in weighted form. We show that under reasonable condition, which is satisfied by the well-known Shannon, Rényi and Tsallis entropies, every entropy function can be defined equivalently in the w...

Entropy-based divergence measures have shown promising results in many areas of engineering and image processing. In this paper, we define a new generalized divergence measure, namely, the Jensen–Rényi divergence. Some properties such as convexity and its upper bound are derived. Based on the Jensen–Rényi divergence, we propose a new approach to the problem of image registration. Some appealing...

We study convexity properties of the Rényi entropy as function $\alpha >0$ on finite alphabets. also describe robustness alphabets, and it turns out that rate respective convergence depends initial alphabet. establish disturbed when distribution is uniform but number events increases to ? prove limit binomial equal Poisson distribution.