Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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
Thomas M. Cover
IEEE Trans. Inf. Theory
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS