Related papers: AG codes and AG quantum codes from the GGS curve
Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional…
In this work, subcovers $\mathcal{X}_{n,r}^s$ of the curve $\mathcal{X}_{n,r}$ are constructed, the Weierstrass semigroup $H(P_\infty)$ at the point $P_\infty \in \mathcal{X}_{n,r}^s$ is determined and the corresponding one-point AG codes…
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.
An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition,…
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…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…
We study the algebraic curve over $\mathbb{F}_{q^2}$ defined by $y^{q+1} = x^n(x^n+1)$, where $n$ is a positive integer coprime to the characteristic. We first prove (when $q$ is odd) that the nonsingular model of this curve is…
We investigate the genera of quotient curves $\mathcal H_q/G$ of the $\mathbb F_{q^2}$-maximal Hermitian curve $\mathcal H_q$, where $G$ is contained in the maximal subgroup $\mathcal M_q\leq{\rm Aut}(\mathcal H_q)$ fixing a pole-polar pair…
In this paper we construct several new families of quantum codes with good and asymptotically good parameters. These new quantum codes are derived from (classical) algebraic geometry (AG) codes by applying the Calderbank-Shor-Steane (CSS)…
In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the…
It is always interesting and important to construct non-Reed-Solomon type MDS codes in coding theory and finite geometries. In this paper, we prove that there are non-Reed-Solomon type MDS codes from arbitrary genus algebraic curves. It is…
Consider a complete flag $\{0\} = C_0 < C_1 < \cdots < C_n = \mathbb{F}^n$ of one-point AG codes of length $n$ over the finite field $\mathbb{F}$. The codes are defined by evaluating functions with poles at a given point $Q$ in points…
Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…
We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic…
Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…
Using an Euclidean approach, we prove a new upper bound for the number of closed points of degree 2 on a smooth absolutely irreducible projective algebraic curve defined over the finite field $\mathbb F\_q$.This bound enables us to provide…
Algebraic-geometric codes on Garcia-Stichtenoth family of curves are used to construct the asymptotically good quantum codes.
We study suitable parameters and relations in a numerical semigroup S. When S is the Weierstrass semigroup at a rational point P of a projective curve C, we evaluate the Feng-Rao order bound of the associated family of Goppa codes. Further…
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…
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…