By Topic

Linear codes for the sum mod-2 multiple-access channel with restricted access

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

2 Author(s)
Poltyrev, G. ; Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel ; Snyders, J.

Transmission of information through a multiple-access-modulo-2 adder channel is addressed for the situation that out of a fixed family of N potential users at most some m, m<N are active simultaneously. The authors assign codes to the N users in a way that the receiver is able to correct any t or less errors and separate the s⩽m messages without a priori knowledge of the subset of active users. A decoding procedure is presented. The efficiency of the method of code construction is demonstrated by some examples and by an upper bound, that asymptotically tends to zero, on the loss of rate

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 3 )