Markov Lemma for Countable Alphabets
Date
2010
Authors
Ho, S.W.
Editors
Aazhang, B.
Georghiades, C.
Georghiades, C.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
IEEE International Symposium on Information Theory - Proceedings, 2010 / Aazhang, B., Georghiades, C. (ed./s), pp.1448-1452
Statement of Responsibility
Conference Name
2010 IEEE International Symposium of Information Theory (13 Jun 2010 - 13 Jul 2010 : Austin, Texas, USA)
Abstract
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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.