New upper bounds on the expected length of one-to-one codes

We present a new lower bound on differential entropy and use it to tighten Wyner's lower bound on discrete entropy, H(X)/spl ges/E log X. As an application example, we derive tighter upper bounds on the expected length of binary one-to-one codes.