Bit probabilities of optimal binary source codes

  • Authors:
  • B. L. Montgomery;H. Diamond;B. V.K. Vijaya Kumar

  • Affiliations:
  • Dept. of Electr. Eng., Pittsburgh Univ., PA;-;-

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

Quantified Score

Hi-index 754.84

Visualization

Abstract

The probabilities of the bits produced by an optimal binary source encoder for a memoryless source are analyzed. The class of sources for which the probability of zero must equal 1/2 for any such encoder is described. Procedures that minimize (maximize) the absolute difference of the bit probabilities are discussed. Corresponding upper bounds are derived and compared for the class of uniform sources