Coding of sources with two-sided geometric distributions and unknown parameters

DOI10.1109/18.817520MaRDI QIDQ4503515zbMATH OpenOpenAlexWikidataFDO

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/4066f856e4b6b077b66476e20147768569ea2c08

zbMATH Keywords

Golomb codesinfinite alphabetlossless image compressionprediction residualssequential codingtwo-sided geometric distributionuniversal codinguniversal modeling

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Source coding (94A29)

Recommendations

• Optimal prefix codes for sources with two-sided geometric distributions
• Universal coding for memoryless sources with countably infinite alphabets
• Aim functions and sequential estimation of the source model for universal coding
• Multi-alphabet universal coding of memoryless sources
• Adaptive compression against a countable alphabet

Cited in

(2)

• Optimal prefix codes for sources with two-sided geometric distributions
• A geometric treatment of the source encoding of a Gaussian random variable

This page was built for publication: Coding of sources with two-sided geometric distributions and unknown parameters

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