English
Related papers

Related papers: Multi-Point AG Codes on the GK Maximal Curves

200 papers

This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with totally ramified places, which enables us to study…

Information Theory · Computer Science 2019-02-25 Chuangqiang Hu , Shudi Yang

A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.

Algebraic Geometry · Mathematics 2022-12-01 Satoru Fukasawa

We determine de Weierstrass semigroup of a pair of certain rational points on the GK-curves. We use this semigroup to obtain two-point AG codes with better parameters than comparable one-point AG codes arising from these curves. These…

Algebraic Geometry · Mathematics 2015-07-24 Alonso Sepúlveda , Guilherme Tizziotti

Algebraic Geometric codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on…

Algebraic Geometry · Mathematics 2011-02-19 Stefania Fanali , Massimo Giulietti

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…

Information Theory · Computer Science 2016-11-15 Kwankyu Lee , Maria Bras-Amorós , Michael E. O'Sullivan

In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all $\mathbb F_{q^2}$-rational points of the curve is determined; the Feng-Rao designed minimum distance is…

Combinatorics · Mathematics 2017-07-18 Daniele Bartoli , Maria Montanucci , Giovanni Zini

In positive characteristic, algebraic curves can have many more automorphisms than expected from the classical Hurwitz's bound. There even exist algebraic curves of arbitrary high genus g with more than 16g^4 automorphisms. It has been…

Algebraic Geometry · Mathematics 2014-02-26 Massimo Giulietti , Gabor Korchmaros

Let $\X$ be an algebraic curve of genus $g \geq 2$ defined over a field $\F_q$ of characteristic $p > 0$. From $\X$, under certain conditions, we can construct an algebraic geometry code $C$. If the code $C$ is self-orthogonal under the…

Information Theory · Computer Science 2013-09-10 A. Elezi , T. Shaska

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…

Information Theory · Computer Science 2019-05-30 T. Shaska , Q. Wang

Let $G$ be a subgroup of the three dimensional projective group $\mathrm{PGL}(3,q)$ defined over a finite field $\mathbb{F}_q$ of order $q$, viewed as a subgroup of $\mathrm{PGL}(3,K)$ where $K$ is an algebraic closure of $\mathbb{F}_q$.…

Algebraic Geometry · Mathematics 2022-02-14 H. Borges , G. Korchmáros , P. Speziali

In this paper we compute the automorphism group of the curves $\mathcal{X}_{a,b,n,s}$ and $\mathcal{Y}_{n,s}$ introduced in Tafazolian et al. in 2016 as new examples of maximal curves which cannot be covered by the Hermitian curve. They…

Algebraic Geometry · Mathematics 2023-01-19 Maria Montanucci , Guilherme Tizziotti , Giovanni Zini

In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…

Information Theory · Computer Science 2025-01-29 Puyin Wang , Jinquan Luo

In this paper we consider the Suzuki curve $y^q + y = x^{q_0}(x^q + x)$ over the field with $q = 2^{2m+1}$ elements. The automorphism group of this curve is known to be the Suzuki group $Sz(q)$ with $q^2(q-1)(q^2+1)$ elements. We construct…

Algebraic Geometry · Mathematics 2014-11-27 Abdulla Eid , Hilaf Hasson , Amy Ksir , Justin Peachey

We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…

Algebraic Geometry · Mathematics 2007-05-23 Jean-Philippe Monnier

Giulietti and Korchm\'aros presented new curves with the maximal number of points over a field of size q^6. Garcia, G\"uneri, and Stichtenoth extended the construction to curves that are maximal over fields of size q^2n, for odd n >= 3. The…

Number Theory · Mathematics 2010-12-17 Iwan M. Duursma

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…

Number Theory · Mathematics 2020-12-14 Benjamin Jones

For every $q=l^3$ with $l$ a prime power greater than 2, the GK curve $X$ is an $F_{q^2}$-maximal curve that is not $F_{q^2}$-covered by any $F_{q^2}$-maximal Deligne-Lusztig curve. Interestingly, $X$ has a very large $F_{q^2}$-automorphism…

Algebraic Geometry · Mathematics 2011-02-19 Stefania Fanali , Massimo Giulietti

We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry.…

Algebraic Geometry · Mathematics 2008-01-28 David Joyner , Amy Ksir , Will Traves

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…

Information Theory · Computer Science 2017-07-07 Chuangqiang Hu , Shudi Yang

Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank…

Information Theory · Computer Science 2016-04-01 Dirk Liebhold , Gabriele Nebe
‹ Prev 1 2 3 10 Next ›