A Lower Bound on the Expected Length of One-to-One Codes

Alon Orlitsky, Noga Alon

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)1670-1672
Number of pages3
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - Sep 1994
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Source coding
  • nonprefix codes
  • one-to-one codes


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