Related papers: Multi-point Codes from the GGS Curves
Automatic code generation for low-dimensional geometric algorithms is capable of producing efficient low-level software code through a high-level geometric domain specific language. Geometric Algebra (GA) is one of the most suitable…
Consider genus $g$ curves that admit degree $d$ covers to elliptic curves only branched at one point with a fixed ramification type. The locus of such covers forms a one parameter family $Y$ that naturally maps into the moduli space of…
We introduce the new notion of the "quasi-Galois point" in Algebraic geometry, which is a generalization of the Galois point. A point $P$ in projective plane is said to be quasi-Galois for a plane curve if the curve admits a non-trivial…
Consider a sequence of AG codes evaluating at a set of evaluation points $P_1,\dots,P_n$ the functions having only poles at a defining point $Q$, with the sequence of codes satisfying the isometry-dual condition (i.e. containing at the same…
We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.
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…
Matthews and Michel investigated the minimum distances in certain algebraic-geometry codes arising from a higher degree place $P$. In terms of the Weierstrass gap sequence at $P$, they proved a bound that gives an improvement on the…
The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…
We study $C_{a, b}$ curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how $C_{a, b}$ curves can be used to construct MDS codes and…
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…
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…
An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…
A problem of current interest, also motivated by applications to Coding theory, is to find explicit equations for \textit{maximal} curves, that are projective, geometrically irreducible, non-singular curves defined over a finite field…
We consider the problem of determining Weierstrass gaps and pure Weierstrass gaps at several points. Using the notion of relative maximality in generalized Weierstrass semigroups due to Delgado \cite{D}, we present a description of these…
We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from…
For each group $G$, $(|G| > 2)$ \, which acts as a full automorphism group on a genus 3 hyperelliptic curve, we determine the family of curves which have 2-Weierstrass points. Such families of curves are explicitly determined in terms of…
Consider a hyperelliptic curve of genus $g$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $2g+2$ Weierstrass points. We prove some general properties of the stable reduction of this…
Let C be the union of two general connected, smooth, nonrational curves X and Y intersecting transversally at a point P. Assume that P is a general point of X or of Y. Our main result, in a simplified way, says: Let Q be a point of X. Then…