We show that the expected length of any one-to-one encod- ing of a discrete random variable X is at least H(X) — log (H(X) + 1) — log e and that this bound is asymptotically achievable.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
- Source coding
- nonprefix codes
- one-to-one codes