Coding in an Asynchronous Multiple-Access Channel

The capacity region for a discrete memoryless channel with asynchronous multiple access is determined. An upper bound is established for the decoding-error probability for lattice codes in the case of Viterbi-algorithm decoding in discrete memoryless channels with synchronous and asynchronous multiple access.