Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints

摘要

The random-code capacity region of a multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.