Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
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
B. Wagle
EJOR
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Bowen Zhou, Bing Xiang, et al.
SSST 2008