Daniel M. Bikel, Vittorio Castelli
ACL 2008
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
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking