DocumentCode
933555
Title
Asynchronous multiple-access channel capacity
Author
Cover, Thomas M. ; Mceliece, Robert J. ; Posner, Edward C.
Volume
27
Issue
4
fYear
1981
fDate
7/1/1981 12:00:00 AM
Firstpage
409
Lastpage
413
Abstract
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.
Keywords
Memoryless channels; Multiple-access communications; Books; Channel capacity; Decoding; Helium; Laboratories; Propulsion; Space technology; Time sharing computer systems; Transmitters; Uncertainty;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1981.1056382
Filename
1056382
Link To Document