2007 IEEE International Symposium on Information Theory 2007
DOI: 10.1109/isit.2007.4557509
|View full text |Cite
|
Sign up to set email alerts
|

The source coding game with a cheating switcher

Abstract: Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) composed of a finite number of subsources with known distributions. Berger's paper 'The Source Coding Game', IEEE Trans. Inform. Theory, 1971, solves this problem under the condition that the adversary is allowed only strictly causal access to the subsource realizations. We consider the case when the adversary has access to the subsource rea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…The proof of this lemma can be found in Appendix B. This lemma specifies the parameter γ(δ) which appears in the decoder operation in (12). Lemma 8 implies that P(E dec,1 |E c enc ), P(E dec,2 |E c enc ) → 0 as n → 0.…”
Section: Decodingmentioning
confidence: 99%
See 2 more Smart Citations
“…The proof of this lemma can be found in Appendix B. This lemma specifies the parameter γ(δ) which appears in the decoder operation in (12). Lemma 8 implies that P(E dec,1 |E c enc ), P(E dec,2 |E c enc ) → 0 as n → 0.…”
Section: Decodingmentioning
confidence: 99%
“…The multiplexer is controlled by a strictly causal switching adversary. An extension of results under adversaries with causal as well as non-causal knowledge of the data has subsequently appeared in [14].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation