About adaptive coding on countable alphabets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2014

About adaptive coding on countable alphabets

Résumé

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.
Fichier principal
Vignette du fichier
aboutAdaptiveCodingInfiniteAlphabet.pdf (293.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00665033 , version 1 (01-02-2012)
hal-00665033 , version 2 (09-03-2014)

Identifiants

Citer

Dominique Bontemps, Stéphane Boucheron, Elisabeth Gassiat. About adaptive coding on countable alphabets. IEEE Transactions on Information Theory, 2014, 60 (2), pp.808-821. ⟨10.1109/TIT.2013.2288914⟩. ⟨hal-00665033v2⟩
318 Consultations
343 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More