Related papers: Two-point AG codes from the Beelen-Montanucci maxi…
We investigate algorithms for encoding of one-point algebraic geometry (AG) codes over certain plane curves called $C_{ab}$ curves, as well as algorithms for inverting the encoding map, which we call "unencoding". Some $C_{ab}$ curves have…
The Geil-Matsumoto bound (GM bound) constrains the number of rational points on a curve over a finite field in terms of the Weierstrass semigroup of any of the points on the curve. For general numerical semigroups, the GM bound lacks a…
In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Suzuki curve $\mathcal{S}_q$. As the point $P$ varies, exactly two possibilities arise for $H(P)$: one for the…
In this paper we study the algebraic-geometry of any one-point code on the Hermitian curve. Moreover, we characterize the minimum-weight codewords of some of their dual codes and describe many their small-weight codewords.
The parameters of the AG codes on general linear groups are found. The hyperplane sections having the minimum (or maximum) number of rational points are determined.
In this paper, we examine algebraic geometric (AG) codes associated with curves generated by separated polynomials, and we create AG codes and quantum stabilizer codes from these curves by varying their parameters. Our research involves a…
An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let m_r(2,q) denote the maximal number n of…
The van der Geer-van der Vlugt curves are Artin-Schreier coverings of the affine line defined by linearized polynomials over finite fields. We give several criteria for them to be maximal or minimal, i.e. attaining the upper or lower bound…
New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…
This paper is concerned with the construction of algebraic geometric codes defined from Kummer extensions. It plays a significant role in the study of such codes to describe bases for the Riemann-Roch spaces associated with totally ramified…
Let $A(n, d)$ denote the maximum size of a binary code of length $n$ and minimum Hamming distance $d$. Studying $A(n, d)$, including efforts to determine it as well to derive bounds on $A(n, d)$ for large $n$'s, is one of the most…
The goal of the paper is to study the limiting behavior of the Weierstrass measures on a smooth curve of genus $g\geqslant 2$ as the curve approaches a certain nodal stable curve represented by a point in the Deligne-Mumford…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
A description of complete normal varieties with lower dimensional torus action has been given by Altmann, Hausen, and Suess, generalizing the theory of toric varieties. Considering the case where the acting torus T has codimension one, we…
A vertex coloring of a graph $G$ is said to be a 2-distance coloring if any two vertices at distance at most $2$ from each other receive different colors, and the least number of colors for which $G$ admits a $2$-distance coloring is known…
This paper considers the \textit{Zarankiewicz problem} in graphs with low-dimensional geometric representation (i.e., low Ferrers dimension). Our first result reveals a separation between bipartite graphs of Ferrers dimension three and…
In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Giulietti-Korchm\'aros curve $\mathcal{X}$. We show that as the point varies, exactly three possibilities arise: One for the…
A classical result states that on a smooth algebraic curve of genus $g$ the number of Weierstrass points, counted with multiplicity, is $g^3-g$. In this paper, we introduce the notion of geometric Weierstrass points of metric graphs and…
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several…
The weight hierarchy of one-point algebraic geometry codes can be estimated by means of the generalized order bounds, which are described in terms of a certain Weierstrass semigroup. The asymptotical behaviour of such bounds for r > 1…