Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
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
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
David A. Selby
IBM J. Res. Dev