A lower bound on the expected length of one-to-one codes

Noga Mordechai Alon, Alon Orlitsky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Number of pages1
DOIs
StatePublished - Dec 1 1994
Externally publishedYes
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: Jun 27 1994Jul 1 1994

Other

Other1994 IEEE International Symposium on Information Theory, ISIT 1994
CountryNorway
CityTrondheim
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 'A lower bound on the expected length of one-to-one codes'. Together they form a unique fingerprint.

  • Cite this

    Alon, N. M., & Orlitsky, A. (1994). A lower bound on the expected length of one-to-one codes. In Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994 [394765] https://doi.org/10.1109/ISIT.1994.394765