Abstract
Shows 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) |
---|---|
Title of host publication | Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994 |
Number of pages | 1 |
DOIs | |
State | Published - Dec 1 1994 |
Externally published | Yes |
Event | 1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: Jun 27 1994 → Jul 1 1994 |
Other
Other | 1994 IEEE International Symposium on Information Theory, ISIT 1994 |
---|---|
Country/Territory | Norway |
City | Trondheim |
Period | 6/27/94 → 7/1/94 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics