pith. sign in

arxiv: cs/0701027 · v2 · submitted 2007-01-05 · 💻 cs.IT · math.IT

The source coding game with a cheating switcher

classification 💻 cs.IT math.IT
keywords sourcefunctionrate-distortionswitcheraccessadversarialcodingcovering
0
0 comments X
read the original 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 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.