102 research outputs found
Two-Point Codes for the Generalized GK curve
We improve previously known lower bounds for the minimum distance of certain
two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve
(GGK). Castellanos and Tizziotti recently described such bounds for two-point
codes coming from the Giulietti-Korchmaros curve (GK). Our results completely
cover and in many cases improve on their results, using different techniques,
while also supporting any GGK curve. Our method builds on the order bound for
AG codes: to enable this, we study certain Weierstrass semigroups. This allows
an efficient algorithm for computing our improved bounds. We find several new
improvements upon the MinT minimum distance tables.Comment: 13 page
An Introduction to Algebraic Geometry codes
We present an introduction to the theory of algebraic geometry codes.
Starting from evaluation codes and codes from order and weight functions,
special attention is given to one-point codes and, in particular, to the family
of Castle codes
Distance bounds for algebraic geometric codes
Various methods have been used to obtain improvements of the Goppa lower
bound for the minimum distance of an algebraic geometric code. The main methods
divide into two categories and all but a few of the known bounds are special
cases of either the Lundell-McCullough floor bound or the Beelen order bound.
The exceptions are recent improvements of the floor bound by
Guneri-Stichtenoth-Taskin, and Duursma-Park, and of the order bound by
Duursma-Park and Duursma-Kirov. In this paper we provide short proofs for all
floor bounds and most order bounds in the setting of the van Lint and Wilson AB
method. Moreover, we formulate unifying theorems for order bounds and formulate
the DP and DK order bounds as natural but different generalizations of the
Feng-Rao bound for one-point codes.Comment: 29 page
Hermitian codes from higher degree places
Matthews and Michel investigated the minimum distances in certain
algebraic-geometry codes arising from a higher degree place . In terms of
the Weierstrass gap sequence at , they proved a bound that gives an
improvement on the designed minimum distance. In this paper, we consider those
of such codes which are constructed from the Hermitian function field. We
determine the Weierstrass gap sequence where is a degree 3 place,
and compute the Matthews and Michel bound with the corresponding improvement.
We show more improvements using a different approach based on geometry. We also
compare our results with the true values of the minimum distances of Hermitian
1-point codes, as well as with estimates due Xing and Chen
- …