By Topic

State constraints for the multiple-access arbitrarily varying channel

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

1 Author(s)
Gubner, J.A. ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA

A discrete multiple-access arbitrarily varying channel with two transmitters and one receiver is considered. It has recently been shown that if such a channel is symmetrizable, then the capacity region has an empty interior. It is shown that if the channel is subject to a suitable state constraint, then the capacity region can contain certain open rectangles and thereby possess a nonempty interior, even if the channel is symmetrizable. A new weak converse under a state constraint is also proved. These results are then used to establish the capacity region of the two-user adder channel under state constraint 1/2

Published in:

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