Generalized T-user codes for multiple-access channels (Corresp.)
T. Ferguson · IEEE Transactions on Information Theory · 1982
Large classes ofT-user codes for the binary adder channel are shown to be easily constructed by generalizing some previous results in two basic ways. The first is an iterative procedure; the second is by introducing an equivalence relation on such codes. Decoding algorithms are presented in both cases. The number of codes in the equivalence class of some previously defined codes is determined exactly.