# Coding for Arbitrarily Varying Remote Sources

## TL;DR

This paper investigates the limits of lossy source coding over an arbitrarily varying channel controlled by an adversary, providing bounds and exact characterizations of the rate distortion function in certain cases.

## Contribution

It introduces bounds and exact solutions for the adversarial rate distortion problem in remote source coding with side information.

## Key findings

- Derived upper and lower bounds on the adversarial rate distortion function.
- Identified special cases where bounds coincide, giving exact rate distortion characterizations.

## Abstract

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another output is received as side information at the decoder. The adversary is assumed to know the source data non-causally, and can employ randomized jamming strategies arbitrarily correlated to the source data. The decoder reconstructs the source data from the encoded message and the side information. We prove upper and lower bounds on the adversarial rate distortion function for the source under randomized coding. Furthermore, we present some interesting special cases of our general setup where the above bounds coincide, and thus, provide their complete rate distortion function characterization.