Publication
IEEE Trans. Inf. Theory
Paper

Tight Lower Bounds for Optimum Code Length

View publication

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

Date

01 Jan 1982

Publication

IEEE Trans. Inf. Theory

Authors

Topics

Share