Coding scheme for T-user noisy multiple-access adder channel

A multi-user coding scheme is proposed for a noisy multiple-access adder channel. Given T
_a
-user δ
_a
-decodable k-ary code A and T
_d
-subset δ
_d
-decodable difference set D with its two component sets D
⁺
and D
^-
a priori, larger error-correcting multi-user code C is obtained. Introducing difference set D makes the total rate of generated code C higher than that of conventional code.