By Topic

Code constructions for asynchronous random multiple-access to the 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)
Plotnik, E. ; Fourier Systems, Petah-Tigva, Israel

A situation where up to T randomly chosen users, out of M potential ones, simultaneously transmit data over the noiseless adder channel (AC) is considered. These T (or fewer) active users operate independently, and because of unknown time offsets among their clocks and different delays that the various messages incur during transmission, both block and bit synchronism are precluded. Code constructions that ensure error-free asynchronous communication over the adder channel are presented. The information rate of these codes=approaches 1/T bits per user. If exactly T users are active, use of these codes leads to an aggregate rate arbitrarily close to 1 bit per channel use. Furthermore, if the occurrence of simultaneous transmissions of more than T users is made known to the active transmitters, such an aggregate rate can be maintained for arbitrary T, TM by means of an adaptive use of the codes

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 1 )