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
Leo Liberti, James Ostrowski
Journal of Global Optimization
Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum