An algebraic approach to computing adjoint curves

Journal of Symbolic Computation

Volumn 23, Issue 2-3, 1997, Pages 229-240

  Mňuk, Michal ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031073045     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0085     Document Type: Article

References (13)

1. Fulton, W. (1989). Algebraic Curves. Addison-Wesley.
2. Haché, G., Le Brigand, D. (To be published). Effective constructions of algebraic geometry codes.
3. Kozen, D. (1994). Efficient resolution of singularities of plane curves. In Proc. 14th Conf. Foundation of Software Technology and Theoretical Computer Science. Madras, India, December 1994.
4. Mňuk, M., Sendra, R., Winkler, F. (1994). On the complexity of parametrizing curves. Technical Report 94-45, Research Institute for Symbolic Computation.
5. Polemi, D., Moreno, C., Moreno, O. (1992). Search and construction of good a.g. goppa codes. Preprint.
6. Schicho, J. (1995). Adjoints and conductors. Private communication.
7. Sendra, J.R., Winkler, F. (1991). Symbolic parametrization of curves. J. Symbolic Computation, 12(6):607-631.
8. Shafarevich, I.A. (1994). Basic Algebraic Geometry, volume 1. Springer Verlag, second edition.
9. Stichtenoth, H. (1993). Algebraic Function Fields and Codes. Springer-Verlag.
10. van Hoeij, M. (1993). An algorithm for computing an integral basis in an algebraic function field. Description of the IntBasis package contained in the Maple share library.
11. van Hoeij, M. (1994). Computing parametrizations of rational algebraic curves. In ISSAC.
12. Walker (1950). Algebraic Curves. Princeton Univ. Press.
13. Zariski, O., Samuel, P. (1975). Commutative Algebra, volume 1. Springer-Verlag.