How to Construct Curves over Finite Fields With Many Points

MaRDI QIDQ4350107zbMATH OpenFDO

Authors Gerard van der Geer, Marcel van der Vlugt

Publication date 28 January 1998

Full work available at URL https://arxiv.org/abs/alg-geom/9511005

zbMATH Keywords

Artin-Schreier curvegeneralized Hamming weightsnumber of rational pointssurveytrace code

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Rational points (14G05) Arithmetic ground fields for curves (14H25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.

Review text

Most of this work is a survey of methods and results from previous articles by the authors relating the weight of a word in a trace code with the number of rational points on an associated Artin-Schreier curve. In particular, [in C. R. Acad. Sci., Paris, Sér. I 317, 593--597 (1993; Zbl 0787.14033)] and [J. Comb. Theory, Ser. A 70, No. 2, 337--348 (1995; Zbl 0824.94025)], the present authors showed that a subcode of a trace code corresponds to a fiber product of Artin-Schreier curves and used this idea to construct curves with many rational points. (Similar results were obtained by \textit{H. Stichtenoth} and \textit{C. Voß} [IEEE Trans. Inf. Theory 40, No. 2, 554--558 (1994; Zbl 0837.94024)] using a function field viewpoint.) By combining methods that they have utilized before, the authors here are able to construct some new curves with more rational points than previously known examples. They give updated versions of the tables of Wirtz on the maximum number of rational points on a curve of a given genus over a given finite field. For the entire collection see [Zbl 0864.00054].

Recommendations

• Hunting for Curves with Many Points
• Curves with many points and configurations of hyperplanes over finite fields
• scientific article; zbMATH DE number 1182977

Cited in

(16)

• Generalized Reed-Muller codes and curves with many points
• A formula for constructing curves over finite fields with many rational points
• On curves covered by the Hermitian curve.
• On maximal curves
• Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
• Curves with many points and configurations of hyperplanes over finite fields
• Classification of all Galois subcovers of the Skabelund maximal curves
• Counting curves over finite fields
• Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
• Quadratic forms, fibre products and some plane curves with many points
• scientific article; zbMATH DE number 1418895 (Why is no real title available?)
• Tables of curves with many points
• Reciprocal polynomials and curves with many points over a finite field
• Quantum error correction with Goppa codes from maximal curves: design, simulation, and performance
• Algebraic hierarchical locally recoverable codes with nested affine subspace recovery
• A new family of maximal curves over a finite field

This page was built for publication: How to Construct Curves over Finite Fields With Many Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350107)