Adaptive compression against a countable alphabet

MaRDI QIDQ2920856zbMATH OpenFDO

Authors Dominique Bontemps, Stéphane Boucheron, Elisabeth Gassiat

Publication date 29 September 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAQ0117/0.html

zbMATH Keywords

adaptive compressioncountable alphabetslossless data compressionminimaxredundancyuniversal coding

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms (68W40) Source coding (94A29)

Recommendations

• Universal coding for memoryless sources with countably infinite alphabets
• Multi-alphabet universal coding of memoryless sources
• Universal almost sure data compression
• Universal sequential coding of single messages
• Universal noiseless coding

Cited in

(2)

• Universal coding for memoryless sources with countably infinite alphabets
• Coding of sources with two-sided geometric distributions and unknown parameters

This page was built for publication: Adaptive compression against a countable alphabet

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