Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets

Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels are studied. Codebooks are applicable to multiple access systems in which the number of transmitting users varies over the life of the system. Several designs of codebooks, based on certain integer sets from (0,1,2,3,. . .,2/sup n/-1), are presented. They are restricted to codebooks which have the rate sum above one and simple and efficient decoding algorithms.<
>