Coding schemes for the noiseless

-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.