Signature coding and information transfer for the multiple access adder channel

We deal with the coding problem of the multiple-access adder channel, considering both the identification of the active users and decoding of their messages. We examine the bounds on the minimal length of codes solving these tasks. We examine codes solving both tasks simultaneously, and we give asymptotic upper and lower bounds on the length of the shortest possible code. Our new bounds are quite similar to the bounds known for the identification task only. The difference between the upper and lower bounds is a factor of two.