Generalized kraft inequality and arithmetic coding

  • Authors:
  • J. J. Rissanen

  • Affiliations:
  • IBM Research Laboratory, San Jose, California

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that Σi2-l i≤2-∈. This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within ∈. The coding speed is comparable to that of conventional coding methods.