Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > MICKEY BRAUTBAR:
All reports by Author Mickey Brautbar:

TR05-084 | 31st July 2005
Mickey Brautbar, Alex Samorodnitsky

Approximating the entropy of large alphabets

We consider the problem of approximating the entropy of a discrete distribution P on a domain of size q, given access to n independent samples from the distribution. It is known that n > q is necessary, in general, for a good additive estimate of the entropy. A problem of ... more >>>




ISSN 1433-8092 | Imprint