Optimal prefix codes for two-sided geometric distributions

A complete characterization of optimal prefix codes is presented for off-centered, two-sided geometric distributions of the integers. These distributions are often encountered in lossless image compression applications, as probabilistic models for image prediction residuals. The family of optimal codes described is an extension of the Golomb (1966) codes, which are optimal for one-sided geometric distributions of non-negative integers.

[1]  David C. van Voorhis,et al.  Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[2]  Julia Abrahams.  Huffman-type codes for infinite source distributions , 1994, Proceedings of IEEE Data Compression Conference (DCC'94).

[3]  Guillermo Sapiro,et al.  LOCO-I: a low complexity, context-based, lossless image compression algorithm , 1996, Proceedings of Data Compression Conference - DCC '96.

[4]  Solomon W. Golomb,et al.  Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[5]  S. Golomb.  Run-length encodings. , 1966 .

[6]  R. F. Rice,et al.  Some practical universal noiseless coding techniques, part 2 , 1983 .