On a Class of Codes of Delsarte
| dc.contributor.author | Welch, L. R. | |
| dc.date.accessioned | 2016-05-14T01:51:53Z | en |
| dc.date.available | 2016-05-14T01:51:53Z | 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/609379 | en |
| dc.description | International Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los Angeles, California | en_US |
| dc.description.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. | |
| 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 | On a Class of Codes of Delsarte | en_US |
| dc.type | text | en |
| dc.type | Proceedings | en |
| dc.contributor.department | University of Southern California | 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-15T04:42:06Z | |
| html.description.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. |
