Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
G. Ramalingam
Theoretical Computer Science
Oliver Bodemer
IBM J. Res. Dev