Skip to Main content Skip to Navigation
Conference papers

A proof of the generalized Markov Lemma with countable infinite sources

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Catherine Magnet Connect in order to contact the contributor
Submitted on : Wednesday, December 10, 2014 - 4:19:40 PM
Last modification on : Monday, December 14, 2020 - 12:38:07 PM

Links full text




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⟩



Les métriques sont temporairement indisponibles