DocumentCode
3039501
Title
A tight upper bound on discrete entropy
Author
Mow, Wai Ho
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
249
Abstract
Based on a result from the theory of Jacobi theta functions, we derive a new discrete entropy bound, which is tight for any asymptotically normal discrete random variable satisfying the required conditions
Keywords
binomial distribution; entropy; information theory; Jacobi theta function; asymptotically normal discrete random variable; binomial random variables; discrete entropy; tight upper bound; Adders; Communication standards; Entropy; Jacobian matrices; Random variables; Read only memory; Upper bound; Welding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613164
Filename
613164
Link To Document