Abstract
We show that the expected length of any one-to-one encoding of a discrete random variable X is at least H(X) - log(H(X)+1) - log e and that this bound is asymptotically achievable.
| Original language | English (US) |
|---|---|
| State | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 6/27/94 → 7/1/94 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics