Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1901.00939 v4 pith:BKQCJNOV submitted 2019-01-03 cs.IT math.IT

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

classification cs.IT math.IT
keywords capacityregioncodeconstraintsarbitrarilyavmaccasedeterministic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.