The Source Coding Game With a Cheating Switcher

DOI10.1109/TIT.2011.2145730MaRDI QIDQ5273552zbMATH OpenOpenAlexFDO

Authors Hari Palaiyanur, Cheng Chang, Anant Sahai

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0701027

Mathematics Subject Classification ID

Applications of game theory (91A80) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Abstract: Berger's paper `The Source Coding Game', IEEE Trans. Inform. Theory, 1971, considers the problem of finding the rate-distortion function for an adversarial source comprised of multiple known IID sources. The adversary, called the `switcher', was allowed only causal access to the source realizations and the rate-distortion function was obtained through the use of a type covering lemma. In this paper, the rate-distortion function of the adversarial source is described, under the assumption that the switcher has non-causal access to all source realizations. The proof utilizes the type covering lemma and simple conditional, random `switching' rules. The rate-distortion function is once again the maximization of the R(D) function for a region of attainable IID distributions.

This page was built for publication: The Source Coding Game With a Cheating Switcher

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273552)