Optimal prefix codes for sources with two-sided geometric distributions

DOI10.1109/18.817513MaRDI QIDQ4503513zbMATH OpenOpenAlexFDO

Authors Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger

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 distributionGolomb codesHuffman codeinfinite alphabetlossless image compressionprediction residualsprefix codestwo-sided geometric distributions

Mathematics Subject Classification ID

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

Recommendations

• Coding of sources with two-sided geometric distributions and unknown parameters
• A combinatorial approach to Golomb forests
• Optimum '1'-ended binary prefix codes
• Algorithms for infinite Huffman-codes
• scientific article; zbMATH DE number 4063000

Cited in

(6)

• Optimal coding of quantized Laplacian sources for predictive image compression
• Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables
• Coding of sources with two-sided geometric distributions and unknown parameters
• Structured prefix codes for quantized low-shape-parameter generalized Gaussian sources
• On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources
• A combinatorial approach to Golomb forests

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503513)