Coding on countably infinite alphabets - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2006

Coding on countably infinite alphabets

Résumé

This paper describes universal lossless coding strategies for compressing sources on countably infinite alphabets. Classes of memoryless sources defined by an envelope condition on the marginal distribution provide benchmarks for coding techniques originating from the theory of universal coding over finite alphabets. We prove general upper-bounds on minimax regret and lower-bounds on minimax redundancy for such source classes. The upper bounds emphasize the role of the Normalized Maximum Likelihood codes with respect to minimax regret in the infinite alphabet context. Lower bounds are derived by tailoring sharp bounds on the redundancy of Krichevsky-Trofimov coders for sources over finite alphabets. Up to logarithmic (resp. constant) factors the bounds are matching for source classes defined by algebraically declining (resp. exponentially vanishing) envelopes. Effective and (almost) adaptive coding techniques are described for the collection of source classes defined by algebraically vanishing envelopes. Those results extend our knowledge concerning universal coding to contexts where the key tools from parametric inference (Bernstein-Von Mises theorem, Wilks theorem) are known to fail.
Fichier principal
Vignette du fichier
nml.pdf (280.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00121892 , version 1 (22-12-2006)
hal-00121892 , version 2 (16-01-2008)

Identifiants

  • HAL Id : hal-00121892 , version 1

Citer

Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat. Coding on countably infinite alphabets. 2006. ⟨hal-00121892v1⟩
615 Consultations
131 Téléchargements

Partager

Gmail Facebook X LinkedIn More