Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
1999
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911217793105920 |
|---|---|
| author | Campillo, A. Farran, J. I. |
| author_facet | Campillo, A. Farran, J. I. |
| contents | We present an algorithm to compute bases for the spaces L(G), provided G is a rational divisor over a non-singular absolutely irreducible algebraic curve, and also another algorithm to compute 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. The method is founded on the Brill-Noether algorithm by combining in a suitable way the theory of Hamburger-Noether expansions and the imposition of virtual passing conditions. Such algorithms are given in terms of symbolic computation by introducing the notion of symbolic Hamburger-Noether expressions. Everything can be applied to the effective construction of Algebraic Geometry codes and also in the decoding problem of such codes, including the case of the Feng and Rao scheme for one-point codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_9910154 |
| institution | arXiv |
| publishDate | 1999 |
| record_format | arxiv |
| spellingShingle | Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes Campillo, A. Farran, J. I. Algebraic Geometry Numerical Analysis 14Q05 (Primary) 11T71 (Secondary) We present an algorithm to compute bases for the spaces L(G), provided G is a rational divisor over a non-singular absolutely irreducible algebraic curve, and also another algorithm to compute 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. The method is founded on the Brill-Noether algorithm by combining in a suitable way the theory of Hamburger-Noether expansions and the imposition of virtual passing conditions. Such algorithms are given in terms of symbolic computation by introducing the notion of symbolic Hamburger-Noether expressions. Everything can be applied to the effective construction of Algebraic Geometry codes and also in the decoding problem of such codes, including the case of the Feng and Rao scheme for one-point codes. |
| title | Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes |
| topic | Algebraic Geometry Numerical Analysis 14Q05 (Primary) 11T71 (Secondary) |
| url | https://arxiv.org/abs/math/9910154 |