The Arbitrarily Varying Relay Channel

by   Uzi Pereg, et al.

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. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency division under input and state constraints. We determine the random code capacity and establish lower and upper bounds on the deterministic code capacity.


page 1

page 2

page 3

page 4


The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division

We consider the arbitrarily varying Gaussian relay channel with sender f...

The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints

We determine both the random code capacity region and the deterministic ...

Strengthened Cutset Upper Bounds on the Capacity of the Relay Channel and Applications

We establish new upper bounds on the capacity of the relay channel which...

Finite Blocklength and Dispersion Bounds for the Arbitrarily-Varying Channel

Finite blocklength and second-order (dispersion) results are presented f...

Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver

The secrecy capacity problems over the general arbitrarily varying wiret...

Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity

The primitive relay channel, introduced by Cover in 1987, is the simples...

The Water Filling Game

We consider the Gaussian arbitrarily varying product channel (GAVPC), an...

Please sign up or login with your details

Forgot password? Click here to reset