Source Coding Problems With Conditionally Less Noisy Side Information
2014 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 60, no 9, 5516-5532 p.Article in journal (Refereed) Published
A computable expression for Heegard and Berger's rate-distortion function has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for physically degraded side information; however, it is not known whether the bound is optimal for arbitrarily correlated side information (general discrete memoryless sources). In this paper, we consider a new setup where the side information at one receiver is conditionally less noisy than that at the other. The new setup includes degraded side information as a special case, and it is motivated by the literature on degraded and less noisy broadcast channels. Our key contribution is a converse proving the optimality of Heegard and Berger's achievability bound in a new setting, where the side information is conditionally less noisy and one distortion function is deterministic. The less noisy setup is also generalized to two different successive-refinement problems.
Place, publisher, year, edition, pages
2014. Vol. 60, no 9, 5516-5532 p.
Rate distortion theory, side information
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-154765DOI: 10.1109/TIT.2014.2337297ISI: 000342415600029ScopusID: 2-s2.0-84906662199OAI: oai:DiVA.org:kth-154765DiVA: diva2:760662
FunderICT - The Next GenerationSwedish Research Council, C0406401
QC 201411042014-11-042014-10-272016-04-15Bibliographically approved