Algorithms for infinite huffman-codes

  title={Algorithms for infinite huffman-codes},
  author={Mordecai J. Golin and Kin Keung Ma},
Optimal (minimum cost) binary prefix-free codes for infinite sources with geometrically distributed frequencies, e.g., P = {pi(1 - p)}∞i=0 0 < p < 1, were first (implicitly) suggested by Golomb over thirty years ago in the context of run-length encodings. Ten years later Gallager and Van Voorhis exhibited such optimal codes for all values of p: Just recently Merhav, Seroussi and Weinberger extended this further to find optimal binary prefix-free codes for two-sided geometric distributions.These… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…