Asynchronous multiple-access channel capacity
Cover, T.; McEliece, R.; Posner, E.
Information Theory, IEEE Transactions on
Volume 27, Issue 4, Jul 1981 Page(s): 409 - 413
Digital Object Identifier
Summary: The capacity region for the discrete memoryless multiple-access channel without time synchronization at the transmitters and receivers is shown to be the same as the known capacity region for the ordinary multiple-access channel. The proof utilizes time sharing of two optimal codes for the ordinary multiple-access channel and uses maximum likelihood decoding over shifts of the hypothesized transmitter words.
View citation and abstract |