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.