Algebraic Geometry Codes from Castle Curves

Authors:
Carlos Munuera;Alonso Sepúlveda;Fernando Torres
Affiliations:
Dept. of Applied Mathematics, University of Valladolid, Castilla, Spain 47012;IMECC-UNICAMP, Campinas-SP, Brasil 13083-970;IMECC-UNICAMP, Campinas-SP, Brasil 13083-970
Venue:
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Year:
2008

Citing 9
Cited 0

Bounding the Trellis State Complexity of Algebraic Geometric Codes

Applicable Algebra in Engineering, Communication and Computing
Algebraic Function Fields and Codes

Algebraic Function Fields and Codes
The minimum distance of codes in an array coming from telescopic semigroups

IEEE Transactions on Information Theory - Part 1
Codes from the Suzuki function field

IEEE Transactions on Information Theory
Generalized Hermitian Codes Over

IEEE Transactions on Information Theory
Near Orders and Codes

IEEE Transactions on Information Theory
On a characterization of certain maximal curves

Finite Fields and Their Applications
On codes from norm-trace curves

Finite Fields and Their Applications
A Class of Polynomials over Finite Fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

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 Qand the Weierstrass semigroup at Qis symmetric.