Error-correcting codes for a T-user binary adder channel
John H. Wilson · IEEE Transactions on Information Theory · 1988
A construction is given which allows error correction of a code for the T-user binary adder channel with two codewords per user. The construction for a noisy channel is generalized to allow a greater freedom in choosing the parameters of the code without decreasing the rate sum. An example which illustrates an efficient decoding algorithm for the noisy channel is given.>