Further results on coding for T-user multiple-access channels (Corresp.)

Coding schemes for the noiseless
T
-user binary adder multiple-access channel are discussed. A class of uniquely decodable codes of arbitrary length satisfying a specific recursive relationship and which are asymptotically good is explicitly constructed.