DeepAI AI Chat
Log In Sign Up

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

01/03/2019
by   Uzi Pereg, et al.
Technion
0

We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. As in the single user case, the boundary of the deterministic code capacity region is a discontinuous function of the input constraint. For the AVMAC without constraints, the characterization due to Ahlswede and Cai is complete except for two cases, pointed out in the literature as an open problem. The missing piece is obtained as a special case of our results.

READ FULL TEXT
01/05/2018

The Arbitrarily Varying Relay Channel

We study the arbitrarily varying relay channel, and establish the cutset...
06/20/2023

Deterministic Identification Over Multiple-Access Channels

Deterministic identification over K-input multiple-access channels with ...
05/29/2018

The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division

We consider the arbitrarily varying Gaussian relay channel with sender f...
12/14/2020

Optimality of Gaussian in Enlarging HK Rate Region, and its Overlap with the Capacity Region of 2-users GIC

This article shows that the set of HK constraints correspond to projecti...
01/03/2019

The Water Filling Game

We consider the Gaussian arbitrarily varying product channel (GAVPC), an...
10/27/2019

Zero-Error Capacity of Multiple Access Channels via Nonstochastic Information

The problem of characterising the zero-error capacity region for multipl...