Effective Construction of Algebraic Geometry Codes

IEEE Transactions on Information Theory

Volumn 41, Issue 6, 1995, Pages 1615-1628

  Haché, Gaétan ^a   Le Brigand, Dominique ^b  

^a INRIA   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

adjoint curves; adjunction divisor; Algebraic geometry codes; blowing up

Indexed keywords

EID: 0001672694     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.476233     Document Type: Article

References (18)

1. M. Bronstein, M. Hassner, A. Vasquez, and C. J. Williamson, “Algebraic algorithms for the construction of error correction codes on algebraic curves,” in Proc. IEEE Int. Symp. on Information Theory, June 1991.
2. A. Campillo, Algebroid Curves in Positive Characteristic (Lecture Notes in Mathematics, vol. 813). Berlin, Germany: Springer-Verlag, 1980.
3. I. M. Duursma, “Algebraic decoding using special divisors,” IEEE Trans. Inform. Theory, vol. 39, no. 2, pp. 694–698, Mar. 1993.
4. D. Duval, “Rational Puiseux expansions,” Comp. Math., vol. 70, pp. 119–154, 1989.
5. V. G. Goppa, “Codes on algebraic curves,” Sov. Math.—Dokl, pp. 170–172, 1981.
6. D. Gorenstein, “An arithmetic theory of adjoint plane curves,” Trans. Amer. Math. Soc., vol. 72, pp. 414–436, 1952.
7. R. Hartshome, Algebraic Geometry. Berlin, Germany: Springer-Verlag, 1977.
8. H. Hironaka, “On the arithmetic genera and the effective genera of algebraic curves,” Memoirs College of Sciences of Kyoto, ser. A, vol. 30, math. 2, pp. 177–195, 1957.
9. M. D. Huang and D. Ierardi, “Efficient algorithms for Riemann-Roch problem and for addition in the Jacobian of a curve,” IEEE Trans. Inform. Theory, vol. 37, pp. 678–687, July 1991.
10. J. Justessen, K. J. Larsen, H. E. Jensen, A. Havemose, and T. Høholdt, “Construction and decoding of a class of algebraic geometry codes,” IEEE Trans. Inform. Theory, vol. 35, no. 4, pp. 811–821, July 1989.
11. D. Lazard, “Solving zero-dimensional algebraic systems,” J. Symb. Comput., vol. 13, 1992.
12. D. Le Brigand and J. J. Risler, “Algorithme de Brill-Noether et codes de Goppa,” Bull. Soc. Math. France, vol. 116, pp. 231–253, 1988.
13. Y. I, Manin and S. G. Vlăduţ, “Linear codes and modular curves,” J. Sov. Math., vol. 30, pp. 2611–2643, 1985.
14. D. Polemi, M. Hassner, O. Moreno, and C. J. Williamson, “A computer algebra algorithm for the adjoint divisor,” in Proc. IEEE Int. Symp. on Information Theory; Jan. 1993.
15. I. R. Shafarevich, Basic Algebraic Geometry, 2nd ed. New York: Springer-Verlag, 1994.
16. H. Stichtenoth, Algebraic Function Fields and Codes (University text). New York: Springer-Verlag, 1993.
17. M. Tsfasman and S. Vlăduţ, Algebraic-Geometric Codes, (Mathematics and its Applications, no. 58). Norwell, MA: Kluwer, 1991.
18. A. T. Vasquez, “Rational desingularization of a curve defined over a finite field,” in Number Theory (New York Seminar, 1989–1990). New York: Springer-Verlag, pp. 229–250.