An efficient multiple-access method for the binary adder channel

The multiple-access problem is addressed from the combined standpoint of both coding and scheduling to arrive at a stable, highly efficient access scheme for the binary adder channel. The authors define a system model that includes the channel and the coding mechanism and explain the M-choose-T communication mode which is fundamental to their method. They then address the system´s performance and show that high throughput (arbitrarily close to 1) is achieved while the access remains stable. They also investigate the average message delay