The source coding game with a cheating switcher
| dc.creator | Palaiyanur, Hari | |
| dc.creator | Chang, Cheng | |
| dc.creator | Sahai, Anant | |
| dc.date | 2007-01-05 | |
| dc.date | 2007-04-19 | |
| dc.date.accessioned | 2026-07-07T08:16:55Z | |
| dc.date.available | 2026-07-07T08:16:55Z | |
| dc.description | 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. | |
| dc.description | 5 pages, 2 figures, submitted to International Symposium on Information Theory 2007; change in notation throughout paper for version 2 | |
| dc.identifier | https://arxiv.org/abs/cs/0701027 | |
| dc.identifier | http://arxiv.org/abs/cs/0701027 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133952 | |
| dc.subject | Information Theory | |
| dc.title | The source coding game with a cheating switcher | |
| dc.type | text |