Title :
Entropy, some new lower bounds
Author :
Topsoe, Flemming
Author_Institution :
Dept. of Math., Copenhagen Univ., Denmark
Abstract :
Let M+1(N) be the set of probability distributions over N and denote by Uk a generic uniform distribution over a k-element set. By H and IC we denote, respectively, entropy and index of coincidence, i.e. H(P) = -Σpk ln pk and IC(P) = Σpk2. The motivation to develop lower bounds lies in applications to certain problems of exact prediction in Bernoulli models.
Keywords :
entropy; information theory; probability; Bernoulli models; entropy; generic uniform distribution; index of coincidence; lower bounds; probability distributions; Character recognition; Councils; Entropy; Error correction; Ink; Mathematics; Pattern recognition; Predictive models; Probability distribution;
Conference_Titel :
Information Theory Workshop, 2002. Proceedings of the 2002 IEEE
Print_ISBN :
0-7803-7629-3
DOI :
10.1109/ITW.2002.1115452