Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
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
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM