Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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
Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking