On Universal D-Semifaithful Coding for Memoryless Sources with Infinite Alphabets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2022

On Universal D-Semifaithful Coding for Memoryless Sources with Infinite Alphabets

Résumé

The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets (∞-alphabets) is addressed in this paper. The main results of this work offer a set of sufficient conditions (from weaker to stronger) to obtain weak minimax universality, strong minimax universality, and corresponding achievable rates of convergences for the worst-case redundancy for the family of stationary memoryless sources whose densities are dominated by an envelope function (or the envelope family) on ∞-alphabets. An important implication of these results is that universal D-semifaithful source coding is not feasible for the complete family of stationary and memoryless sources on ∞-alphabets. To demonstrate this infeasibility, a sufficient condition for the impossibility is presented for the envelope family. Interestingly, it matches the well-known impossibility condition in the context of lossless (variable-length) universal source coding. More generally, this work offers a simple description of what is needed to achieve universal D-semifaithful coding for a family of distributions Λ. This reduces to finding a collection of quantizations of the product space at different block-lengths-reflecting the fixed distortion restriction-that satisfy two asymptotic requirements: the first is a universal quantization condition with respect to Λ, and the second is a vanishing information radius (I-radius) condition for Λ reminiscent of the condition known for lossless universal source coding.
Fichier principal
Vignette du fichier
universal-d-semifaithfull-countable-alph.pdf (978.05 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03999468 , version 1 (21-02-2023)
hal-03999468 , version 2 (22-06-2023)

Identifiants

Citer

Jorge Silva, Pablo Piantanida. On Universal D-Semifaithful Coding for Memoryless Sources with Infinite Alphabets. IEEE Transactions on Information Theory, 2022, 68 (4), pp.2782-2800. ⟨10.1109/TIT.2021.3134891⟩. ⟨hal-03999468v2⟩
38 Consultations
35 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More