Conference paper
Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Paper
Tight Lower Bounds for Optimum Code Length
Abstract
A new lower bound for the mean code length of all one-to-one codes for a random variable with n outcomes is derived. The bound, which is tight, improves an earlier one due to Leung-Yan-Cheong and Cover. Another bound for one-to-one codes for binary information sources is derived. ©1982 IEEE
Related
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009