A proof of the generalized Markov Lemma with countable infinite sources - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A proof of the generalized Markov Lemma with countable infinite sources

Pablo Piantanida
L. Rey Vega
  • Fonction : Auteur
A. O. Hero
  • Fonction : Auteur

Résumé

The Generalized Markov Lemma has been used in the proofs of several multiterminal source coding theorems for finite alphabets. An alternative approach to extend this result to countable infinite sources is proposed. We establish sufficient conditions to guarantee the joint typicality of reproduction sequences of random descriptions that have not been necessarily generated from the product of probability measures. Compared to existing proofs for finite alphabets, our technique is simpler and self-contained. It also offers bounds on the asymptotic tail probability of the typicality event providing a scaling law for a large number of source encoders.

Dates et versions

hal-01093440 , version 1 (10-12-2014)

Identifiants

Citer

Pablo Piantanida, L. Rey Vega, A. O. Hero. A proof of the generalized Markov Lemma with countable infinite sources. ISIT 2014, Jun 2014, Honolulu, Hawaï, United States. pp.591 - 595, ⟨10.1109/ISIT.2014.6874901⟩. ⟨hal-01093440⟩
55 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More