Tight lower bounds for optimum code length (Corresp.)

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.