On the optimality of generalized time-sharing for M-ary multiple-access channels

This paper addresses the problem of approaching any rate in the capacity region of an asynchronous M-user multiple-access channel via a sequence of at most 2M-1 encoding/decoding operations for point-to-point channels. The focus is on discrete-time memoryless multiple-access channels although the absence of memory does not seems to be crucial. This work was motivated by Grant and Rasmussen (1995)