By Topic

Existence of Good δ-Decodable Codes for the Two-User Multiple-Access 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
$33 $33
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

3 Author(s)
Shu Lin ; University of Hawaii at Manoa, USA ; Tadao Kasami ; Saburo Yamamura

This paper defines a class of δ-decodable codes for the two-user multiple-access adder channel with binary inputs. This class is a generalization of the class of two-user codes investigated by Kasami and Lin (1978). Lower bounds on the achievable rates of codes in this class are derived. We show that, for a wide range of error correcting capability, this class contains good two-user δ-decodable codes with rates lying above the timesharing line.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:24 ,  Issue: 4 )