By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gubner, J.A. ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; Hughes, B.L.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 1 )