T-user uniquely decodable k-ary affine code for multiple-access adder channel
Multi-user uniquely decodable (UD) k-ary coding for the multiple-access adder channel is investigated. It is shown that a Tf+g+1-user UD k-ary affine code with code length f+g+1 can be obtained from two T-f-user and T-g-user UD k-ary affine codes. This leads to construct recursively a T-n-user UD k-ary affine code with arbitrary code length n. The total rate of the code tends to be higher than those of all the multi-user UD k-ary codes reported previously as the number of users increases.
affine code adder channel multiple-access communication multi-user code uniquely decodable code