Two-Point Codes for the Generalized GK Curve - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2018

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.
Fichier principal
Vignette du fichier
twopoint_ggkcurve.pdf (309.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01535513 , version 1 (09-06-2017)
hal-01535513 , version 2 (07-10-2017)



Elise Barelli, Peter Beelen, Mrinmoy Datta, Vincent Neiger, Johan Rosenkilde. Two-Point Codes for the Generalized GK Curve. IEEE Transactions on Information Theory, In press, ⟨10.1109/TIT.2017.2763165⟩. ⟨hal-01535513v2⟩
290 View
262 Download



Gmail Facebook Twitter LinkedIn More