The Arbitrarily Varying Relay Channel

TL;DR

This paper investigates the arbitrarily varying relay channel, establishing bounds on its capacity and identifying conditions for deterministic code capacity, advancing understanding of communication limits under adversarial conditions.

Contribution

It introduces bounds on the random code capacity and conditions for deterministic capacity in arbitrarily varying relay channels, extending existing theoretical frameworks.

Findings

Established the cutset and partial decode-forward bounds on random code capacity.

Determined the random code capacity for specific cases.

Identified conditions where deterministic code capacity can be characterized.

Abstract

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well.