Two-Point Codes for the Generalized GK curve
Information Theory
2017-10-10 v2 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1706.00800,
title = {Two-Point Codes for the Generalized GK curve},
author = {Elise Barelli and Peter Beelen and Mrinmoy Datta and Vincent Neiger and Johan Rosenkilde},
journal= {arXiv preprint arXiv:1706.00800},
year = {2017}
}
Comments
13 pages