Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes

In this paper, we consider some practical applications of the symbolic Hamburger-Noether expressions for plane curves, which are introduced as a symbolic version of the so-called Hamburger-Noether expansions. More precisely, we give and develop in symbolic terms algorithms to compute the resolution tree of a plane curve (and the adjunction divisor, in particular), rational parametrizations for the branches of such a curve, special adjoints with assigned conditions (connected with different problems, like the so-called Brill-Noether algorithm), and the Weierstrass semigroup at P together with functions for each value in this semigroup, provided P is a rational branch of a singular plane model for the curve. Some other computational problems related to algebraic curves over perfect fields can be treated symbolically by means of such expressions, but we deal just with those connected with the effective construction and decoding of algebraic geometry codes.

[1]  D. Duval.  Rational Puiseux expansions , 1989 .

[2]  Review: F. Enriques and O. Chisini, Lezioni sulla Teoria Geometrica delle Equazioni e delle Funzioni Algebriche , 1935 .

[3]  Gaétan Haché,et al.  Computation in Algebraic Function Fields for Effective Construction of Algebraic-Geometric Codes , 1995, AAECC.

[4]  Gaétan Haché,et al.  Construction effective des codes geometriques , 1996 .

[5]  V. D. Goppa.  Codes on Algebraic Curves , 1981 .

[6]  T. Willmore.  Algebraic Geometry , 1973, Nature.

[7]  Ruud Pellikaan,et al.  On the decoding of algebraic-geometric codes , 1995, IEEE Trans. Inf. Theory.

[8]  José Ignacio Farrán,et al.  Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models , 1999, ArXiv.

[9]  Marc Rybowicz.  Sur le calcul des places et des anneaux d'entiers d'un corps de fonctions algebriques , 1990 .

[10]  Antonio Campillo,et al.  Algebroid Curves in Positive Characteristic , 1980 .

[11]  Miles Reid,et al.  Commutative Ring Theory , 1989 .

[12]  D. Le Brigand,et al.  Algorithme de Brill-Noether et codes de Goppa , 1988 .

[13]  E. Casas-Alvero,et al.  Infinitely near imposed singularities and singularities of polar curves , 1990 .

[14]  J. Lipman.  On Complete Ideals in Regular Local Rings , 1988 .

[15]  Ming-Deh A. Huang,et al.  Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve , 1994, J. Symb. Comput..

[16]  Eduardo Casas-Alvero,et al.  Singularities of plane curves , 2000 .

[17]  Ruud Pellikaan,et al.  The minimum distance of codes in an array coming from telescopic semigroups , 1995, IEEE Trans. Inf. Theory.

[18]  Ming-Deh A. Huang,et al.  Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[19]  Daniel Gorenstein,et al.  An arithmetic theory of adjoint plane curves , 1952 .

[20]  T. R. N. Rao,et al.  Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.

[21]  Dominique Le Brigand,et al.  Effective construction of algebraic geometry codes , 1995, IEEE Trans. Inf. Theory.