By Topic

Universal coding for multiple access channels

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
$33 $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)

The problems of universal coding and decoding for multiple-access channels are examined. The hypothetical mutual information functions are used to prove that rate vectors R=(R_{1},R_{2}) in a subregion \hat{cal C} of the capacity region cal C are universally achievable in the sense that there exist codes of rate R that are asymptotically optimum for all multiple-access channels with finite fixed input alphabets X_{1},X_{2} , and output alphabet Y .

Published in:

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