On the minimum distance of AG codes, on Weierstrass semigroups and the smoothability of certain monomial curves in 4-Space

TL;DR

This paper explores the relationship between Weierstrass semigroups and algebraic geometric codes, providing methods to estimate code minimum distances and proving certain semigroups are Weierstrass.

Contribution

It introduces a way to evaluate the Feng-Rao Order Bound for code minimum distance and proves that semigroups generated by an arithmetic sequence in four variables are Weierstrass.

Findings

Feng-Rao Order Bound effectively estimates minimum distance.

Semigroups generated by an arithmetic sequence in four variables are Weierstrass.

Survey of tools for recognizing Weierstrass semigroups in characteristic zero.

Abstract

In this paper we treat several topics regarding numerical Weierstrass semigroups and the theory of Algebraic Geometric Codes associated to a pair $(X, P)$, where $X$ is a projective curve defined over the algebraic closure of the finite field $F_q$ and P is a $F_q$-rational point of $X$. First we show how to evaluate the Feng-Rao Order Bound, which is a good estimation for the minimum distance of such codes. This bound is related to the classical Weierstrass semigroup of the curve $X$ at $P$. Further we focus our attention on the question to recognize the Weierstrass semigroups over fields of characteristic 0. After surveying the main tools (deformations and smoothability of monomial curves) we prove that the semigroups of embedding dimension four generated by an arithmetic sequence are Weierstrass.