By Topic

Error-correcting codes for a T-user binary adder channel

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)
Wilson, J.H. ; Dept. of Math., Centre Coll., Danville, KY, USA

A construction is given which allows error correction of a code for the T-user binary adder channel with two codewords per user. The construction for a noisy channel is generalized to allow a greater freedom in choosing the parameters of the code without decreasing the rate sum. An example which illustrates an efficient decoding algorithm for the noisy channel is given

Published in:

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