Show simple item record

dc.contributor.authorMcEliece, Robert J.
dc.contributor.authorRubin, Arthur L.
dc.date.accessioned2016-05-14T01:51:57Zen
dc.date.available2016-05-14T01:51:57Zen
dc.date.issued1976-09en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/609380en
dc.descriptionInternational Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los Angeles, Californiaen_US
dc.description.abstractThe capacity region of a multiple-access channel has recently been identified as the convex hull K̄ of a certain set K of points in the first quadrant of the (R₁,R₂) plane. For a pair of rates in K, a more or less standard random coding argument can be used to show the existence of a good pair of codes. But for points in K̄-K, it is apparently necessary for the two senders to use some form of timesharing to achieve the desired rates. However, in order to timeshare, at least one of the senders must have knowledge of the other's phase; and in many practical situations this knowledge does not exist. In this paper we investigate the problems which arise in coding for multiple access channels when the senders cannot synchronize with each other.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.titleTimesharing without Synchronizationen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentCaltech’s Jet Propulsion Laboratoryen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-04-13T00:21:48Z
html.description.abstractThe capacity region of a multiple-access channel has recently been identified as the convex hull K̄ of a certain set K of points in the first quadrant of the (R₁,R₂) plane. For a pair of rates in K, a more or less standard random coding argument can be used to show the existence of a good pair of codes. But for points in K̄-K, it is apparently necessary for the two senders to use some form of timesharing to achieve the desired rates. However, in order to timeshare, at least one of the senders must have knowledge of the other's phase; and in many practical situations this knowledge does not exist. In this paper we investigate the problems which arise in coding for multiple access channels when the senders cannot synchronize with each other.


Files in this item

Thumbnail
Name:
ITC_1976_76-02-2.pdf
Size:
158.0Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record