Show simple item record

dc.contributor.authorStepanov, S. A.en_US
dc.contributor.authorÖzbudak, F.en_US
dc.date.accessioned2016-02-08T12:00:00Z
dc.date.available2016-02-08T12:00:00Z
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/11693/27709
dc.description.abstractA method of constructing long geometric Goppa codes coming from fiber products of superelliptic curves is presented. A family of smooth projective curves with a lot of Fq-rational points are needed to produce a family of asymptotically good geometric Goppa codes. The genus in every such family is considerably less than the number of rational points, so the corresponding geometric Goppa codes have rather good parameters. Examples of such families are provided by modular curves, by Drinfeld modular curves, and by Artin-Schreier coverings of the projective line.en_US
dc.language.isoEnglishen_US
dc.source.titleIEEE International Symposium on Information Theory - Proceedingsen_US
dc.subjectAlgorithmsen_US
dc.subjectDecodingen_US
dc.subjectPolynomialsen_US
dc.subjectVectorsen_US
dc.subjectSmooth projective curvesen_US
dc.subjectSuperelliptic curvesen_US
dc.subjectCodes (symbols)en_US
dc.titleFibre products of superelliptic curves and codes therefromen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Mathematicsen_US
dc.citation.spage413en_US
dc.publisherIEEE, Piscataway, NJ, United Statesen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record