A Code Structure for Certain Coma Environments
| dc.contributor.author | Milstein, Laurence B. | |
| dc.contributor.author | Ragonetti, Ronald R. | |
| dc.date.accessioned | 2016-05-14T01:52:19Z | en |
| dc.date.available | 2016-05-14T01:52:19Z | en |
| dc.date.issued | 1976-09 | en |
| dc.identifier.issn | 0884-5123 | en |
| dc.identifier.issn | 0074-9079 | en |
| dc.identifier.uri | http://hdl.handle.net/10150/609366 | en |
| dc.description | International Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los Angeles, California | en_US |
| dc.description.abstract | Certain communication systems which employ code division multiple access as a means of supporting multiple users need very long codes to guard against the threat of intentional jamming, but cannot tolerate the lengthy acquisition time which long codes usually require. As a possible solution to this problem, the use of combination sequences has been suggested, and this paper presents some new results, both analytical and numerical, on this technique. | |
| dc.description.sponsorship | International Foundation for Telemetering | en |
| dc.language.iso | en_US | en |
| dc.publisher | International Foundation for Telemetering | en |
| dc.relation.url | http://www.telemetry.org/ | en |
| dc.rights | Copyright © International Foundation for Telemetering | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.title | A Code Structure for Certain Coma Environments | en_US |
| dc.type | text | en |
| dc.type | Proceedings | en |
| dc.contributor.department | R.P.I. | en |
| dc.identifier.journal | International Telemetering Conference Proceedings | en |
| dc.description.collectioninformation | Proceedings 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.dateFOA | 2018-06-15T02:21:08Z | |
| html.description.abstract | Certain communication systems which employ code division multiple access as a means of supporting multiple users need very long codes to guard against the threat of intentional jamming, but cannot tolerate the lengthy acquisition time which long codes usually require. As a possible solution to this problem, the use of combination sequences has been suggested, and this paper presents some new results, both analytical and numerical, on this technique. |
