Conference Proceedings

Algebraic geometry codes from castle curves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5228 LNCS 117-127
DOI: 10.1007/978-3-540-87448-5_13
19Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The quality of an algebraic geometry code depends on the curve from which the code has been defined. In this paper we consider codes obtained from Castle curves, namely those whose number of rational points attains the Lewittes' bound for some rational point Q and the Weierstrass semigroup at Q is symmetric. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Munuera, C., Sepúlveda, A., & Torres, F. (2008). Algebraic geometry codes from castle curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5228 LNCS, pp. 117–127). https://doi.org/10.1007/978-3-540-87448-5_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free