Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
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
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS