Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ISIT.2014.6874901 | ISIT |
Keywords | DocType | Citations |
asymptotic tail probability,multiterminal source coding theorem,distributed source coding problem,generalized Markov Lemma,source coding,countable infinite sources,Markov processes | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pablo Piantanida | 1 | 389 | 55.41 |
| Leonardo Rey Vega | 2 | 107 | 17.14 |
| Alfred O. Hero III | 3 | 2600 | 301.12 |