An Enhanced Covering Lemma for Multiterminal Source Coding
classification
💻 cs.IT
math.IT
keywords
codingenhancedlemmacoveringsourceachievabilityaveragechain
read the original abstract
An enhanced covering lemma for a Markov chain is proved in this paper, and then the distributed source coding problem of correlated general sources with one average distortion criterion under fixed-length coding is investigated. Based on the enhanced lemma, a sufficient and necessary condition for determining the achievability of rate-distortion triples is given.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.