About adaptive coding on countable alphabets

Abstract : This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and non-decreasing hazard rate. We prove that the auto-censuring AC code introduced by Bontemps (2011) is adaptive with respect to the collection of such classes. The analysis builds on the tight characterization of universal redundancy rate in terms of metric entropy % of small source classes by Opper and Haussler (1997) and on a careful analysis of the performance of the AC-coding algorithm. The latter relies on non-asymptotic bounds for maxima of samples from discrete distributions with finite and non-decreasing hazard rate.
Complete list of metadatas

Cited literature [49 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00665033
Contributor : Elisabeth Gassiat <>
Submitted on : Sunday, March 9, 2014 - 3:43:40 PM
Last modification on : Friday, January 10, 2020 - 9:08:58 PM
Long-term archiving on: Monday, June 9, 2014 - 10:35:59 AM

Files

aboutAdaptiveCodingInfiniteAlp...
Files produced by the author(s)

Identifiers

Citation

Dominique Bontemps, Stéphane Boucheron, Elisabeth Gassiat. About adaptive coding on countable alphabets. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, 60 (2), pp.808-821. ⟨10.1109/TIT.2013.2288914⟩. ⟨hal-00665033v2⟩

Share

Metrics

Record views

583

Files downloads

335