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.
Type de document :
Article dans une revue
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, 60 (2), pp.808-821. <10.1109/TIT.2013.2288914>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00665033
Contributeur : Elisabeth Gassiat <>
Soumis le : dimanche 9 mars 2014 - 15:43:40
Dernière modification le : lundi 29 mai 2017 - 14:26:53
Document(s) archivé(s) le : lundi 9 juin 2014 - 10:35:59

Fichiers

aboutAdaptiveCodingInfiniteAlp...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

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>

Partager

Métriques

Consultations de
la notice

341

Téléchargements du document

116