On Cyclic Codes for the T-User Q-Ary Adder Channel

This paper addresses the construction of q-ary cyclic codes for the synchronous noiseless T-user q-ary adder channel (T-QAC). This construction is adaptive in the sense that the decoder will correctly identify any t active users, 0/spl les/t/spl les/T, and correctly recover their respective messages, i.e., any subset of t active users (unknown in advance to the decoder) will be uniquely decoded. A very low complexity decoding procedure is given and it is shown that the maximum achievable sum rate is 1.