Computer Science – Information Theory
Scientific paper
2010-06-02
Computer Science
Information Theory
5 pages, ISIT2010, Austin
Scientific paper
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same limitation. Recently, a new notion of typicality, namely unified typicality, has been defined. It can be applied to both finite or countably infinite alphabets, and it retains the asymptotic equipartition property and the structural properties of strong typicality. In this paper, unified typicality is used to derive a version of the Markov lemma which works on both finite or countably infinite alphabets so that many results in multiterminal source coding can readily be extended. Furthermore, a simple way to verify whether some sequences are jointly typical is shown.
No associations
LandOfFree
Markov Lemma for Countable Alphabets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Markov Lemma for Countable Alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Markov Lemma for Countable Alphabets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-512618