Optimal prefix codes for sources with two-sided geometric distributions

DOI10.1109/18.817513zbMath1003.94021OpenAlexW2133231636MaRDI QIDQ4503513

Neri Merhav, Marcelo J. Weinberger, Gadiel Seroussi

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7f565e283ed088813fad98f99f350f5460a5658c

zbMATH Keywords

exponential distributionprefix codeslossless image compressionHuffman codeinfinite alphabetGolomb codesprediction residualstwo-sided geometric distributions

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Signal detection and filtering (aspects of stochastic processes) (60G35) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

A combinatorial approach to Golomb forests

This page was built for publication: Optimal prefix codes for sources with two-sided geometric distributions