Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
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
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
John M. Boyer, Charles F. Wiecha
DocEng 2009