By Topic

Coding for T-user 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
$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)

Coding schemes for the binary memoryless T -user adder channel are investigated in this paper. First upper and lower bounds on the capacity sum, which are asymptotically tight with increasing T , are derived for the noiseless case. Second, a class of T -user uniquely decodable codes with rates, asymptotically in T , equal to the maximal achievable values is constructed. A decoding algorithm for these codes is also presented. Next, a class of error-correcting codes for the noisy T -user adder channel is constructed. It is shown that these codes can he used to construct multilevel codes suitable for use on the additive white Gaussian noise channel.

Published in:

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