This paper characterizes the Weierstrass semigroup at multiple points on the GK curve, identifies pure gaps, and applies these findings to construct algebraic geometry codes with improved parameters.
Contribution
It provides explicit descriptions of the Weierstrass semigroup and pure gaps at multiple points on the GK curve, enabling better code construction.
Findings
01
Explicit description of Weierstrass semigroup at multiple points
02
Conditions for identifying pure gaps on the GK curve
03
Construction of algebraic geometry codes with improved parameters
Abstract
We determine the Weierstrass semigroup H(P∞,P1,…,Pm) at several points on the GK curve. In addition, we present conditions to find pure gaps on the set of gaps G(P∞,P1,…,Pm). Finally, we apply the results to obtain AG codes with good relative parameters.
\left\{\begin{array}[]{cl}lub\{{\bf u}_{1},\ldots,{\bf u}_{m}\}\in\mathbb{N}_{0}^{m}:&{\bf u}_{i}\in\Gamma(P_{1},\ldots,P_{m})\\
&\mbox{ or }(u_{i_{1}},\ldots,u_{i_{k}})\in\Gamma(P_{i_{1}},\ldots,P_{i_{k}})\\
&\mbox{ for some }\{i_{1},\ldots,i_{k}\}\subset\{1,\ldots,m\}\mbox{ such that }\\
&i_{1}<\cdots<i_{k}\mbox{ and }u_{i_{k+1}}=\cdots=u_{i_{\ell}}=0,\\
&\mbox{ where }\{i_{k+1},\ldots,i_{m}\}\subset\{1,\ldots,\ell\}\setminus\{i_{1},\ldots,i_{k}\}\end{array}\right\}\;.
\left\{\begin{array}[]{cl}lub\{{\bf u}_{1},\ldots,{\bf u}_{m}\}\in\mathbb{N}_{0}^{m}:&{\bf u}_{i}\in\Gamma(P_{1},\ldots,P_{m})\\
&\mbox{ or }(u_{i_{1}},\ldots,u_{i_{k}})\in\Gamma(P_{i_{1}},\ldots,P_{i_{k}})\\
&\mbox{ for some }\{i_{1},\ldots,i_{k}\}\subset\{1,\ldots,m\}\mbox{ such that }\\
&i_{1}<\cdots<i_{k}\mbox{ and }u_{i_{k+1}}=\cdots=u_{i_{\ell}}=0,\\
&\mbox{ where }\{i_{k+1},\ldots,i_{m}\}\subset\{1,\ldots,\ell\}\setminus\{i_{1},\ldots,i_{k}\}\end{array}\right\}\;.
\begin{array}[]{rcl}(x-a_{j})&=&(n^{3}+1)P_{j}-(n^{3}+1)P_{\infty},\mbox{ for }j=1,\ldots,n;\\
(y)&=&\sum_{j=1}^{n}(n^{2}-n+1)P_{j}-n(n^{2}-n+1)P_{\infty};\\
(z)&=&\sum_{j=1}^{n}P_{j}+\sum_{\ell=1}^{n^{3}-n}Q_{\ell}-n^{3}P_{\infty}.\end{array}
\begin{array}[]{rcl}(x-a_{j})&=&(n^{3}+1)P_{j}-(n^{3}+1)P_{\infty},\mbox{ for }j=1,\ldots,n;\\
(y)&=&\sum_{j=1}^{n}(n^{2}-n+1)P_{j}-n(n^{2}-n+1)P_{\infty};\\
(z)&=&\sum_{j=1}^{n}P_{j}+\sum_{\ell=1}^{n^{3}-n}Q_{\ell}-n^{3}P_{\infty}.\end{array}
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
Full text
\ProvidesLanguage
portuges
Weierstrass Semigroup and Pure Gaps at several points on the GK curve
A. S. Castellanos and G. Tizziotti
Abstract.
We determine the Weierstrass semigroup H(P∞,P1,…,Pm) at several points on the GK curve. In addition, we present conditions to find pure gaps on the set of gaps G(P∞,P1,…,Pm). Finally, we apply the results to obtain AG codes with good relative parameters.
1. Introduction
Curves with many rational points and a large automorphism group have been investigated for their applications in coding theory. In [9], Giulietti and Korchmáros introduced a maximal curve, so called GK curve, which is not a subcover of the corresponding Hermitian curve. The GK curve is one of the rare examples of curves over a finite field where the automorphism group Aut(GK) is rather large with respect to the genus. Another interesting fact about this curve is that the set of rational points splits into two non-trivial orbits, O1 and O2, and Aut(GK) acts on O1 as PGU(3,n) in its doubly transitive permutation representation, see [6, Theorem 3.4]. More recently, we can find applications of the GK curve in coding theory, see [1], [3] and [6].
As is known, Weierstrass semigroup is also an important tool in coding theory, see e.g. [2], [8] and [13]. In this work, we determine the Weierstrass semigroup H(P∞,P1,…,Pm) at m+1 points on O1, with 1≤m≤∣O1∣, where P∞ is the single point at infinity on GK. Our results were obtained using the concept of discrepancy, for given rational points P and Q on a curve X, see Definition 2.5. This concept was introduced by Duursma and Park in [5], and it was our main tool for obtain the set Γ(P∞,P1,…,Pm), called minimal generating set of H(P∞,P1,…,Pm), see Theorem 3.4. In addition, we present conditions to find pure gaps on the set of gaps G(P∞,P1,…,Pm).
This paper is organized as follows. Section 2 contains general results about Weierstrass semigroup and discrepancy, in addition to basic facts about AG codes and the GK curve. In Section 3, we determine the minimal generating set for the Weierstrass semigroup H(P∞,P1,…,Pm) at points on the orbit O1 cited above. Finally, in Section 4 we present some results about pure gaps and AG codes over the GK curve.
2. Preliminaries
We begin this section by introducing some notations that will be used in this work. Let X be a nonsingular, projective, geometrically irreducible curve of genus g≥1 defined over a finite field Fq, let Fq(X) be the field of rational functions and Div(X) be the set of divisors on X. For f∈Fq(X), the divisor of f will be denoted by (f) and the divisor of poles of f by (f)∞. For a divisor G on X, let L(G):={f∈Fq(X)\mbox;(f)+G≥0}∪{0} be the Riemann-Roch space of G and let dim(L(G)) be the dimension of L(G) as an Fq-vector space. Let Ω(G) be the space of differentials η on X such that η=0 or div(η)≥G, where div(η)=∑P∈XordP(η)P and ordP(η) is the order of η at P. As follows, we denote N0=N∪{0}, where N is the set of positive integers.
2.1. Weierstrass semigroup and Discrepancy
Let P1,…,Pm be distinct rational points on X. The set
[TABLE]
is called the Weierstrass semigroup at the points P1,…,Pm. It is not difficult to see that the set H(P1,…,Pm) is a semigroup. An element in N0m∖H(P1,…,Pm) is called gap and the set G(P1,…,Pm)=N0m∖H(P1,…,Pm) is called gap set of P1,…,Pm.
Define a partial order ⪯ on N0m by (n1,…,nm)⪯(p1,…,pm) if and only if ni≤pi for all i, 1≤i≤m.
For u1,…,ut∈N0m, where, for all k, uk=(uk1,…,ukm), we define the least upper bound (lub) of the vectors u1,…,ut in the following way:
[TABLE]
For n=(n1,…,nm)∈N0m and i∈{1,…,m}, we set
[TABLE]
Proposition 2.1**.**
[12, Proposition 3]**
Let n=(n1,…,nm)∈N0m. Then n is minimal, with respect to ⪯, in ∇i(n) for some i, 1≤i≤m, if and only if n is minimal in ∇i(n) for all i, 1≤i≤m.
Proposition 2.2**.**
[12, Proposition 6]**
Suppose that 1≤t≤m≤q and u1,…,ut∈H(P1,…,Pm). Then lub{u1,…,ut}∈H(P1,…,Pm).
Definition 2.3**.**
Let Γ(P1)=H(P1) and, for m≥2, define
[TABLE]
Lemma 2.4**.**
[12, Lemma 4]**
For m≥2, Γ(P1,…,Pm)⊆G(P1)×⋯×G(Pm).
In [12], Theorem 7, it is shown that, if 2≤m≤q, then H(P1,…,Pm)=
[TABLE]
Therefore, the Weierstrass semigroup H(P1,…,Pm) is completely determined by Γ(P1,…,Pm). In [12], Matthews called the set Γ(P1,…,Pm) of minimal generating set of H(P1,…,Pm).
In [5, Section 5], Duursma and Park introduced the concept of discrepancy as follows.
Definition 2.5**.**
A divisor A∈Div(X) is called a discrepancy for two rational points P and Q on X if L(A)=L(A−P)=L(A−P−Q) and L(A)=L(A−Q)=L(A−P−Q).
The next result relates the concept of discrepancy with the set Γ(P1,…,Pm).
Lemma 2.6**.**
[4, Lemma 2.6]**
Let n=(n1,…,nm)∈H(P1,…,Pm). Then n∈Γ(P1,…,Pm) if and only if the divisor A=n1P1+⋯+nmPm is a discrepancy with respect to P and Q for any two rational points P,Q∈{P1,…,Pm}.
2.2. AG codes
Let D=P1+…+Pn be a divisor on X such that Pi=Pj for i=j. Let G be another divisor on X such that supp(D)∩supp(G)=∅. Consider the maps ev:L(G)→Fqn and φ:Ω(G−D)→Fqn defined, respectively, by ev(f):=(f(P1),…,f(Pn)) and φ(η):=(resP1(η),…,resPn(η)), where resPi(η) is the residue of η at Pi, i=1,…,n. We define the AG codes CL(D,G) and CΩ(D,G) as the images of the maps ev and φ, respectively. That is,
[TABLE]
The AG codes CL(D,G) and CΩ(D,G) are dual to each other. Let [n,k,d] and [n,kΩ,dΩ] be the length, dimension and minimum distance of CL(D,G) and CΩ(D,G), respectively. By Riemann-Roch Theorem we can estimate the parameters [n,k,d] and [n,kΩ,dΩ]. In particular, if 2g−2<deg(G)<n, we have that k=deg(G)−g+1, d≥n−deg(G), kΩ=n−deg(G)+g−1 and dΩ≥deg(G)−2g+2, see e.g. [15]. The right-hand side of the inequalities involving the minimum distance is known as the Goppa bound. One of the ways to obtain codes with good parameters is to find codes whose minimum distance have bounds better than the Goppa bound. In addition, another way is study codes over curves with many rational points, more specifically, codes arising from maximal curves. We remember that a curve X of genus g over Fq is a maximal curve if its number of rational points attains the Hasse-Weil upper bound, namely equals 2gq+q+1.
If G=aQ for some rational point Q on X and D is the sum of all the other rational points on X, then the AG codes CL(D,G) and CΩ(D,G) are called one-point AG codes. Analogously, if G=a1Q1+⋯+amQm, for m distinct rational points on X and D is the sum of all the other rational points on X, then CL(D,G) and CΩ(D,G) are called m-point AG codes. For more details about coding theory, see [10], [14] and [15].
2.3. The GK curve
Let q=n3, where n≥2 is a prime power. The GK curve over Fq2 is the curve of P3(Fq2) with affine equations
[TABLE]
where h(X)=i=0∑n(−1)i+1Xi(n−1). We will denote this curve simply by GK. The curve GK is absolutely irreducible, nonsingular, has n8−n6+n5+1Fq2-rational points, a single point at infinity P∞=(1:0:0:0) and its genus is g=21(n3+1)(n2−2)+1. The GK curve has an important properties as it lies on the Hermitian surface H3 with affine equation Xn3+X=Yn3+1+Zn3+1; it is a maximal curve and, for q>8, GK is the only know curve that is maximal but not Fq2-covered by the Hermitian curve H2 defined over Fq2 and its automorphism group Aut(GK) has size n3(n3+1)(n2−1)(n2−n+1) which turns out to be very large compared to the genus g.
Let GK(Fq2) be the set of Fq2-rational points of GK. For j=1,…,n, let Pj=(aj,0,0)∈GK(Fq2) such that ajn+aj=0, and, for ℓ=1,…,n3−n, let Qℓ=(aℓ,bℓ,0)∈GK(Fq2) such that bℓ=0 and aℓn+aℓ=bℓn+1. In the following, P∞, Pj, for j=1,…,n, and Qℓ, for ℓ=1,…,n3−n, will be the points given above.
Since P∞ is a single point at infinity of GK and the function field Fq2(GK) is Fq2(x,y,z) with zn2−n+1=yh(x) and xn+x=yn+1 we have that
[TABLE]
Theorem 2.7**.**
[6, Theorem 3.4]**
The set of Fq2-rational points of GK splits into two orbits under the action of Aut(GK). One orbit, say O1, has size n3+1 and consists of the points Pj and Qℓ as above together with the infinite point P∞. The other orbit has size n3(n3+1)(n2−1) and consists of the points P=(a,b,c)∈GK(Fq2) with c=0. Furthermore, Aut(GK) acts on O1 as PGU(3,n) in its doubly transitive permutation representation.
Proposition 2.8**.**
[6, Proposition 3.1]**
Let Pj and Qℓ be as above. Then, H(P∞)=H(Pj)=H(Qℓ)=⟨n3−n2+n,n3,n3+1⟩, for each j=1,…,n, and ℓ=1,…,n3−n.
3. The Weierstrass semigroup at certain m+1 points on GK curve
In this section we will determine the Weierstrass semigroup H(P∞,P1,…,Pm), for 1≤m≤n. To simplify the notation, we will denote a=n2−n+1, b=n3 and c=n3+1. By the divisors of the rational functions (x−aj), y and z given in (2), we have the following equivalences
[TABLE]
[TABLE]
[TABLE]
Let 1≤m≤n and let 1≤k≤a, 0≤i≤n and js≥0 be integers such that
[TABLE]
So, the divisor
[TABLE]
is effective and using (3), (4) and (5) we have that
[TABLE]
The following lemma is important to show that a divisor is a discrepancy.
Lemma 3.1**.**
[7, Noether’s Reduction Lemma]**
Let D be a divisor, P∈X and let K be a canonical divisor. If dim(L(D))>0 and dim(L(K−D−P))=dim(L(K−D)), then dim(L(D+P))=dim(L(D)).
Proposition 3.2**.**
The divisor A′ is a discrepancy with respect to P and Q for any two distinct points P,Q∈{P∞,P1,…,Pm}.
Proof
First, note that the equivalence of effective divisors in (7) gives a rational
function f∈L(A′) with pole divisor equal to A′. Thus, L(A′)=L(A′−P) for all P∈{P∞,P1,…,Pm}.
Now, we must prove that L(A′−P)=L(A′−P−Q) and L(A′−Q)=L(A′−Q−P), for all P,Q∈{P∞,P1,…,Pm}. By Lemma 3.1, it suffices to prove that L(K−A′+P)=L(K−A′+P+Q), where K is a canonical divisor. Taking K=(n2−2)cP∞, we have that
[TABLE]
If P∞∈{P,Q}, without loss of generality, assume that P=P∞ and Q=P1. Thus,
[TABLE]
and we have that
[TABLE]
So, L(A′−Q)=L(A′−P−Q).
Since L(A′)=L(A′−Q)=L(A′−P−Q) and L(A′)=L(A′−P), it follows that L(A′−P)=L(A′−P−Q).
If P∞∈{P,Q}, we can suppose that P=P1 and Q=P2. In this case, we have that
[TABLE]
As above, it follows that L(A′−Q)=L(A′−P−Q) and that L(A′−P)=L(A′−P−Q).
Therefore, A′ is a discrepancy with respect to P and Q for any two distinct points P,Q∈{P∞,P1,…,Pm}.
□
Remark 3.3**.**
From (7) and Definition 2.5 follows that the divisor ((n2−m−∑s=1mjs)c−ina−kb)P∞+∑s=1m(jsc+ia+k)Ps is also a discrepancy with respect to P and Q for any two distinct points P,Q∈{P∞,P1,…,Pm}.
Theorem 3.4**.**
Let a, b, c, P∞,P1,…,Pm be as above. For 1≤m≤n, let
[TABLE]
Then, Γ(P∞,P1,…,Pm)=Γm+1.
Proof
By Proposition 3.2, A′ is a discrepancy with respect to P and Q for any two distinct points P,Q∈{P∞,P1,…,Pm}. By Remark 3.3, the divisor
A=((n2−m−∑s=1mjs)c−ina−kb)P∞+∑s=1m(jsc+ia+k)Ps
is a discrepancy with respect to P and Q for any two distinct points P,Q∈{P∞,P1,…,Pm}. Therefore, by Lemma 2.6, we have that Γm+1⊆Γ(P∞,P1,…,Pm).
Next, we show that Γ(P∞,P1,…,Pm)⊆Γm+1. Let n=(n0,n1,…,nm)∈Γ(P∞,P1,…,Pm). By Definition 2.3 and Proposition 2.1, follows that n is minimal in ∇r(n) for all r, 1≤r≤m+1. By Lemma 2.4,
n=(n0,n1,…,nm)∈G(P∞)×G(P1)×⋯×G(Pm).
Note that H(Ps)=⟨an,b,c⟩, for all 1≤s≤m, and then ns=jsc+isa+ks, for some js≥0, 0≤is≤n and 1≤ks≤a. Let
[TABLE]
Then, (f)∞=((n2−m−∑s=1mjs)c−ina−kb)P∞+(j1c+ia+k)P1+⋯+(jmc+ia+k)Pm. Now, by Remark 3.3, (f)∞ is a discrepancy with respect to P and Q for any two distinct points P,Q∈{P∞,P1,…,Pm} and so, by Lemma 2.6,
Thus, f∈∇r(n), for some 1≤r≤m+1, and, by Proposition 2.1, it follows that f is minimal in ∇r(n) for all r, 1≤r≤m+1. Therefore, by minimality of f and n, we have that f=n and Γ(P∞,P1,…,Pm)⊆Γm+1.
□
Example 3.5**.**
For n=2, we have a=3,b=8,c=9, and the curve GK with affine equations
[TABLE]
In this case, the genus g=10 and, by Proposition 2.8, H(P1)=H(P2)=H(P∞)=⟨6,8,9⟩ and then G(P0)=G(P∞)={1,2,3,4,5,7,10,11,13,19}. We have the following divisors
[TABLE]
where ℓ=1,2. For this curve, taking m=1, by Theorem 3.4, we have that Γ(P∞,P1)={(9(3−j1)−6i−8k,9j1+3i+k):0≤i≤2,1≤k≤3,j1≥0\mboxand9(3−j1)−6i−8k>0},
therefore
An element (α1,…,αm)∈G(P1,…,Pm) is called pure gap if dim(L(∑i=1mαiPi))=dim(L(∑i=1mαiPi−Pj)), for all j=1,…,m. This concept was introduced by M. Homma and S.J. Kim in [11]. In [2], C. Carvalho and F. Torres used the concept of pure gaps to obtain codes whose minimum distance have bounds better than the Goppa bound.
Theorem 4.1**.**
[2, Theorem 3.3]**
Let Q1,…,Qn,P1,…,Pm be distinct Fq-rational points of X and assume that m≤q. Let (α1,…,αm),(β1,…,βm)∈N0m and set D=Q1+⋯+Qn and G=∑i=1m(αi+βi−1)Pi. Let dΩ be the minimum distance of the code CΩ(D,G). If (α1,…,αm) and (β1,…,βm) are pure gaps at P1,…,Pm, then dΩ≥deg(G)−(2g−2)+m, where g is the genus of X.
Using the concept of discrepancy we have the following result to obtain pure gaps.
Proposition 4.2**.**
Let A=∑ℓ=0maℓPℓ, where (a0,a1,…,am)∈Γ(P0,P1,…,Pm). Let ℓ∈{0,1,…,m}, if L(A−Pℓ)=L(A−2Pℓ), then
(a0,a1,…,aℓ−1,aℓ−1,aℓ+1,…,am)* is a pure gap of H(P0,P1,…,Pm).*
Proof.
In fact, by Lemma 2.6, the divisor A is a discrepancy with respect to P and Q for any two distinct points P,Q∈{P0,P1,…,Pm}. So, L(A−Pℓ)=L(A−Pℓ−Q) for any Q∈{P0,P1,…,Pm}∖{Pℓ}. Thus, if L(A−Pℓ)=L(A−2Pℓ), by definition of pure gap, follows that (a0,a1,…,aℓ−1,aℓ−1,aℓ+1,…,am) is a pure gap of H(P0,P1,…,Pm).
∎
For Corollary 4.3 and Lemma 4.4 in the following, consider the GK curve over Fn6 with genus g. We remember that a=n2−n+1, b=n3, c=n3+1 and 1≤m≤n, and that P∞,P1,…,Pm are the rational points given in Section 3.
Corollary 4.3**.**
If 2≤k≤a, then ((n2−m)c−kb,k,…,k,k−1) is a pure gap of Weierstrass semigroup H(P∞,P1,…,Pm) on GK.
Proof.
In fact, first note that ((n2−m)c−kb,k,…,k,k)∈Γ(P∞,P1,…,Pm) by taking i=0 and js=0, for all s=1,…,m, in the Theorem 3.4. Let A=((n2−m)c−kb)P∞+∑s=1mkPs. By the previous Lemma, we must prove that L(A−Pm)=L(A−2Pm). Let K=(2g−2)P∞=(n2−2)cP∞ be a canonical divisor. Note that zk−2(x−a1)…(x−am−1)∈L(K−A+2Pm)∖L(K−A+Pm) and so L(K−A+Pm)=L(K−A+2Pm). Thus, by Lemma 3.1, it follows that L(A−Pm)=L(A−2Pm).
∎
Proposition 4.4**.**
Let α<2g−1 and (α,1,1,…,1)∈G(P∞,P1,…,Pm). If
i) ∃λ,β,γ∈N0, with λ≥m, such that λc+βan+γb=2g−1−α, or
ii) 2g−1−α≥(m−1)c and ∃β,γ∈N0 such that βan+γb=2g−1−α,
then (α,1,1,…,1) is a pure gap.
Proof.
Let α<2g−1 and (α,1,1,…,1)∈G(P∞,P1,…,Pm). Consider the divisor A=αP∞+P1+⋯+Pm and the canonical divisor K=(2g−2)P∞. We will see that, if the conditions i) or ii) as above are satisfied, then L(K−A)=L(K−A+P∞) and L(K−A)=L(K−A+Pi), for all i=1,…,m. Thus, Lemma 3.1, we conclude that (α,1,1,…,1) is a pure gap.
First, suppose that ∃λ,β,γ∈N0, with λ≥m, such that λc+βan+γb=2g−1−α. Since λ≥m, we can write λ=λ1+⋯+λm, with λi≥1 for all i=1,…,m. So, (x−a1)λ1…(x−am)λmyβzγ∈L(K−A+P∞)∖L(K−A) and x−ai(x−a1)…(x−am)∈L(K−A+Pi)∖L(K−A), for all i=1,…,m. Therefore, we have that (α,1,1,…,1) is a pure gap.
Now, suppose that 2g−1−α≥(m−1)c and ∃β,γ∈N0 such that βan+γb=2g−1−α. So, yβzγ∈L(K−A+P∞)∖L(K−A) and x−ai(x−a1)…(x−am)∈L(K−A+Pi)∖L(K−A), for all i=1,…,m. Therefore, we have that (α,1,1,…,1) is a pure gap.
∎
Let us remember that given a code C with parameters [n,k,d], we define its information rate by R=k/n and its relative minimum distance by δ=d/n. These parameters allows us to compare codes with different length. In the following example we get a code that have better relative parameters than the corresponding one-point code given in [6, Table IV].
Example 4.5**.**
Consider the GK curve over F36 with affine equations
[TABLE]
This curve has 6076F36-rational points and genus g=99. By Corollary 4.3 and Proposition 4.4, respectively, it follows that (142,2,2,1) and (155,1,1,1) are pure gaps at P∞,P1,P2,P3. By Theorem 4.1, the 4-point code CΩ(D,296P∞+2P1+2P2+P3) of dimension kΩ=5869 has minimum distance dΩ≥109.
Bibliography15
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] D. Bartoli, M. Montanucci and G. Zini, Multi point AG codes on the GK maximal curve , Designs, Codes and Cryptography, to appear.
2[2] C. Carvalho e F. Torres, On Goppa codes and Weierstrass gaps at several points , Des. Codes Cryptogr., 35(2) (2005), 211-225.
3[3] A. S. Castellanos, G. Tizziotti, Two-Point AG Codes on the GK Maximal Curves . IEEE Transactions on Information Theory, v. 62, p. 681-686, 2016.
4[4] A. S. Castellanos, G. Tizziotti, On Weierstrass semigroup at m 𝑚 m points on curves of the form f ( y ) = g ( x ) 𝑓 𝑦 𝑔 𝑥 f(y)=g(x) , to appear in Journal of Pure and Applied Algebra.
5[5] I. Duursma and S. Park, Delta sets for divisors supported in two points , Finite Fields and Their Applications, 18 (5), 2012, 865-885.
6[6] S. Fanali and M. Giulietti, One-point AG Codes on the GK Maximal Curves , IEEE Trans. on Information Theory, vol. 56, no. 1, pp. 202 - 210, 2010.
7[7] W. Fulton, Algebraic Curves: an introduction to Algebraic Geometry , Addison Wesley, 1969.
8[8] A. Garcia, S. J. Kim, and R. F. Lax, Consecutive Weierstrass gaps and minimum distance of Goppa codes , J. Pure Appl. Algebra, 84 (1993), 199-207.