Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 1981 | Published
Journal Article Open

Asynchronous multiple-access channel capacity

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.

Additional Information

© 1981 IEEE. Reprinted with permission. Manuscript received July 3, 1978; revised August 21, 1980. This work was Supported by NSF Grant ECS78-23334. Stanford Research Institute ARPA Contract DAHC-15-C-0187, and at the Jet Propulsion Laboratory of the California Institute of Technology by the National Aeronautics and Space Administration under Contract N157-100.

Attached Files

Published - COVieeetit81.pdf

Files

COVieeetit81.pdf
Files (737.2 kB)
Name Size Download all
md5:a021488aaa9cc3f2d961497aad9bcc4a
737.2 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023