Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Upper bounds on the entropy of a countable integer-valued random variable are furnished in terms of the expectation of the logarithm function. In particular, an upper boundisderived that is sharper than that of Elias, H(P) ≤ EP(log) + 2(1 + √Ep(log)), for all values of Ep(log). Bounds that are better only for large values of Ep(log) than the previous known upper bounds are also provided. © 1988 IEEE
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Limin Hu
IEEE/ACM Transactions on Networking
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering