By Topic

Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets

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)
Jevtic, D.B. ; Dept. of Math. Sci., Alaska Univ., Fairbanks, AK, USA

Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels are studied. Codebooks are applicable to multiple access systems in which the number of transmitting users varies over the life of the system. Several designs of codebooks, based on certain integer sets from {0,1,2,3,. . .,2n-1}, are presented. They are restricted to codebooks which have the rate sum above one and simple and efficient decoding algorithms

Published in:

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