Persistent Link:
http://hdl.handle.net/10150/609379
Title:
On a Class of Codes of Delsarte
Author:
Welch, L. R.
Affiliation:
University of Southern California
Issue Date:
1976-09
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:
In reference [1], Delsarte generalized a class of codes due to Chien and Choy [2] which, in turn, are a generalization of Goppa Codes [3]. Delsarte shows that almost all of these codes meet the Gilbert-Varsharmov bound, a result which is also true of Goppa codes [4]. Both of these results are obtained by showing that the actual minimum distance is much larger than the "designed" distance and approaches the G-V bound for the designed rate. This talk raises the question as to how large the actual rate can be for fixed design distance. No new theorems are presented but two well known theorems are proved in the context of Delsarte's presentation.
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.titleOn a Class of Codes of Delsarteen_US
dc.contributor.authorWelch, L. R.en
dc.contributor.departmentUniversity of Southern Californiaen
dc.date.issued1976-09en
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.abstractIn reference [1], Delsarte generalized a class of codes due to Chien and Choy [2] which, in turn, are a generalization of Goppa Codes [3]. Delsarte shows that almost all of these codes meet the Gilbert-Varsharmov bound, a result which is also true of Goppa codes [4]. Both of these results are obtained by showing that the actual minimum distance is much larger than the "designed" distance and approaches the G-V bound for the designed rate. This talk raises the question as to how large the actual rate can be for fixed design distance. No new theorems are presented but two well known theorems are proved in the context of Delsarte's presentation.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/609379en
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.