By Topic

An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel (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

2 Author(s)

It is shown that for an asymmetric multiple-access channel, it is possible, starting with one codeword at each of the encoders, to add the codewords for one message at a time (first for the elements in the set of private messages and thereafter for the messages in the set of common messages) and to construct this way, iteratively, a code for this channel with the average error probability upper-bounded by an exponentially small quantity. Using this result, it is subsequently shown that a code for the asymmetric multiple-access channel can also be generated by only. a few (linear in the block length) permutations, still keeping the average error probability upper-bounded by the same error bound and in this way gaining storage space.

Published in:

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