Consider M − HChoose P − T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method for constructing codes that achieve error-free M − HChoose P − T communication over the noiseless Adder Channel (AC), at a nominal rate of 1/ T bits per channel symbol per active user, is described and an efficient deco...