Lower bound on the expected length of one-to-one codes

Noga Alon, Alon Orlitsky

Research output: Contribution to conferencePaper

2 Scopus citations

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 languageEnglish (US)
StatePublished - Dec 1 1994
Externally publishedYes
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: Jun 27 1994Jul 1 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period6/27/947/1/94

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Lower bound on the expected length of one-to-one codes'. Together they form a unique fingerprint.

  • Cite this

    Alon, N., & Orlitsky, A. (1994). Lower bound on the expected length of one-to-one codes. Paper presented at Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, .