Stepanov, Serguei A.Özbudak, Ferruh2016-02-082016-02-081997http://hdl.handle.net/11693/27709Date of Conference: 29 June-4 July 1997Conference Name: IEEE International Symposium on Information Theory, IEEE 1997A 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.EnglishAlgorithmsDecodingPolynomialsVectorsSmooth projective curvesSuperelliptic curvesCodes (symbols)Conference Paper10.1109/ISIT.1997.613350