By Topic

A strong outer bound to the capacity region for multiple access channels (Corresp.)

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)

Arimoto's converse to the coding theorem for discrete memoryless channel is extended to multiple access channels. The strong outer bound to the capacity region for multiple access channels that results is described analytically and graphically.

Published in:

Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 4 )