By Topic

Concatenated codes 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
$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)

A coding theorem for concatenated codes for the memoryless multiple access channel is established, and it is shown that in the capacity region the probability of error is bound above by a function of the overall length N_{o}=nN and the overall rate vector R_{o}=(r_{l}R_{1},r_{2}R_{2}) .

Published in:

IEEE Transactions on Information Theory  (Volume:26 ,  Issue: 2 )