Further results on coding for T-user multiple-access channels (Corresp.)
Shih-Chun Chang · IEEE Transactions on Information Theory · 1984
Coding schemes for the noiselessT-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.