Thomas M. Cheng
IT Professional
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
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering