A multiuser k-ary code for the noisy multiple-access adder channel
Jun Cheng, Yoichiro Watanabe · IEEE Transactions on Information Theory · 2001
Multiuser k-ary coding is proposed for a noisy multiple-access adder channel. It is shown that when a T-user /spl delta/-decodable k-ary code C is given a priori, a qT-user /spl lambda//spl delta/-decodable k-ary code C/sup */ is obtained by using a matrix, such as a Hadamard matrix or a conference matrix of order q, where /spl lambda/ is a positive integer depending on the matrix. More noteworthy is that the code C is an arbitrary /spl delta/-decodable k-ary code, and that the coding scheme preserves the total rate, i.e., the total rate of C/sup */ is equal to that of C.