Persistent Link:
http://hdl.handle.net/10150/609931
Title:
The Power of Desarguesian Sets
Author:
Wu, W. W.
Affiliation:
Communications Satellite Corporation
Issue Date:
1978-11
Rights:
Copyright © International Foundation for Telemetering
Collection Information:
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.
Publisher:
International Foundation for Telemetering
Journal:
International Telemetering Conference Proceedings
Abstract:
A Desarguesian set is a planar Euclidean geometry difference set which can be used to derive new cyclic block codes, convolutional self-orthogonal codes, and random multiple access codes. This paper discusses the usefulness of these codes and presents the step-by-step procedure for the purpose of constructing such sets. Comparisons are also made with planar projective geometry sets in which two types of existing codes were obtained.
Sponsors:
International Foundation for Telemetering
ISSN:
0884-5123; 0074-9079
Additional Links:
http://www.telemetry.org/

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titleThe Power of Desarguesian Setsen_US
dc.contributor.authorWu, W. W.en
dc.contributor.departmentCommunications Satellite Corporationen
dc.date.issued1978-11-
dc.rightsCopyright © International Foundation for Telemeteringen
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
dc.publisherInternational Foundation for Telemeteringen
dc.description.abstractA Desarguesian set is a planar Euclidean geometry difference set which can be used to derive new cyclic block codes, convolutional self-orthogonal codes, and random multiple access codes. This paper discusses the usefulness of these codes and presents the step-by-step procedure for the purpose of constructing such sets. Comparisons are also made with planar projective geometry sets in which two types of existing codes were obtained.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123-
dc.identifier.issn0074-9079-
dc.identifier.urihttp://hdl.handle.net/10150/609931-
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.typetexten
dc.typeProceedingsen
dc.relation.urlhttp://www.telemetry.org/en
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.