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

  • Authors:

  • N. Alon;A. Orlitsky

  • Affiliations:

  • Dept. of Math., Tel Aviv Univ.;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1994

Quantified Score

Hi-index 754.84

Visualization

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