Bases for Riemann–Roch spaces of linearized function fields with applications to generalized algebraic geometry codes
Abstract
In this paper, we determine explicit bases for Riemann–Roch spaces of linearized function fields, and we give a lower bound for the minimum distance of generalized algebraic geometry codes. As a consequence, we construct generalized algebraic geometry codes with good parameters.
keywords:
Riemann–Roch spaces; Algebraic curves; Algebraic function fields; Generalized algebraic geometry codes;1 Introduction
In 1999, Xing, Niederreiter, and Lam [8] presented a construction of linear codes based on algebraic curves over finite fields that generalizes the algebraic geometry codes (AG codes) introduced two decades before by Goppa. These codes are called generalized algebraic geometry codes (GAG codes), and the main feature of this construction is that it is possible to use places of arbitrary degree. In 2002, Heydtmman [3] studied how to define and represent the dual code of a GAG code, and she gave a decoding algorithm for this kind of codes. Later, Dorfer and Maharaj gave a short proof of the duality result presented by Heydtmman, and they showed generator and parity check matrices for GAG codes. To calculate those matrices as well as to determine the parameters of GAG codes, Riemann–Roch spaces play a fundamental role, as in Goppa’s construction. The paper is organized as follows.
In Section 2, we recall the definition of GAG codes, their properties, and present a generalization of the lower bound for the minimum distance given by Picone in [6]. In Section 3, we show the main properties of linearized function fields and calculate explicit bases of the Riemann–Roch spaces. Analogous results for function fields of Kummer type were proved by Garzón and Navarro in [1]. In Section 4, we show examples of GAG codes with good parameters, using the results obtained in the previous sections.
2 Generalized algebraic geometry codes
The following notation will be used throughout this correspondence. Let be an algebraic function field with genus . The Riemann–Roch space corresponding to the divisor is defined as
where is the principal divisor of . is a finite-dimensional vector space over , and its dimension is denoted by .
The differentials space of the divisor is defined as
where denotes the differentials space of . is also a finite-dimensional vector space over , and its dimension, called the index of specialty of , is
For a canonical divisor of , is also equal to . Let be distinct places of of degrees , respectively, and be a divisor with support disjoint from the support of the divisor . Let be an linear code over , and let be a fixed -linear isomorphim mapping onto for any . Let . The generalized algebraic geometry codes (GAG codes) and are defined as the images of the -linear maps
If we take rational places and for each we choose the trivial lineal code over and the identity map on , then the GAG codes reduce to AG codes.
Now, we recall some results concerning to the parameters of GAG codes.
Theorem 2.1.
is an code with parameters
where
Furthermore, if , then , and the equality holds if .
Theorem 2.2.
is an code with parameters
where
Furthermore, if then
and the equality holds if .
We state the lower bound for the minimum distance of a GAG code given by Picone.
Theorem 2.3.
([6, Proposition 2.9]) Let be an algebraic function field of genus and distinct places of of degrees respectively, and be an linear code over for any . Let , , , and be divisors of with support disjoint from the support of . Suppose and . If and for , then the minimum distance of the code satisfies
We remove some hypotheses from the result above to obtain a more general lower bound.
Here, it is necessary to introduce the notion of the greatest common divisor of two divisors. Given and , two divisors of a function field , the greatest common divisor of and is defined as
Theorem 2.4.
Let be an algebraic function field of genus and distinct places of of degrees respectively, and be an linear code over for any . Let , , , and be divisors of with support disjoint from the support of . Suppose , . If , then the minimum distance of the code satisfy
where
Proof.
Let such that is a non-zero codeword of minimum weight. Let be the set of all such that and let be the complement of in . Then
(1) |
Consider the divisor . Since is zero for , then , that is, . Thus, is an effective divisor such that and we have . Taking degrees of both sides, we get that
then
Summing in both sides of the inequality above, we have
hence
(2) |
if we assume . Finally, from (1) and (2) the desired result follows. It remains to prove that . Notice that
(3) |
By the Riemann–Roch Theorem, we get
and
hence,
(4) |
Since is effective and and have support disjoint from the support of , we get
As
then
and thus
(5) |
In a similar way, note that
implies
and hence
(6) |
Finally, we have
(7) |
∎
Corollary 2.5.
Let be an algebraic function field of genus and distinct places of of degrees respectively, and be a linear code over for any . Let , , and be divisors of with support disjoint from the support of . Suppose and . If , then the minimum distance of the code satisfies
where
Proof.
This follows immediately from Proposition 2.4, taking . ∎
We use this result in Section 4 to construct examples of GAG codes with good parameters.
3 Bases for Riemann–Roch spaces of linearized function fields
We start this section by defining linearized function fields and showing some important properties that will be used frequently.
A linearized function field is a function field defined by the equation
(8) |
with a linearized polynomial, , and roots in . We assume throughout that the factorization into irreducibles of and is and respectively, and the positive integers , are coprime to .
Proposition 3.1.
With the notations above, we have the following:
-
1.
For , let (resp. ) be the zero of (resp. the pole of ) in . The places and are totally ramified places in .
-
2.
The functions form an integral basis at any place of different from and . Moreover, and are the only ramified places in .
-
3.
For , let (resp. ) be the only zero of (resp. the only pole of ) in . Then the principal divisor of in is
-
4.
For , let be the only zero of in . Then splits completely in . Moreover, the principal divisor of in is
where is the only zero of in lying over , for each .
Proof.
-
1.
Let be a place lying over and let be the index of ramification of . Since we have and
(9) By the equation (9) and as , then is totally ramified and In the same way as before, we have that is totally ramified and with
-
2.
Let be any place of different from , and , and let be a place of lying over . It is clear that the minimum polynomial of over satisfies
and , then by [[7], Corollary 3.5.11] is an integral basis of at and is not ramified in .
-
3.
Since the principal divisor of in is and the places and are totally ramified, then
-
4.
The place is a zero of because it is the zero of in , then . The reduction modulus of is the polynomial
which has all its roots in , hence there exist places lying over by [[7], Theorem 3.3.7]. One of them is a zero of lying over , and we will call it . It is clear that . All of the above allows us to conclude that
∎
We can now formulate our main results.
Theorem 3.2.
Consider the divisor on the function field defined by the equation (8) where for . Then
is a generator set of
Proof.
We first show that . By Proposition 3.1.3, 4 and since the divisor of is , we have that the divisor of the function satisfies the inequality
with and for any . Since and , then we conclude that and the -linear span of is a subset of .
Next, we prove that every element of can be expressed as a linear combination of elements from with coefficients from . Let be a non-zero element. Then the places and are the only possible poles of . Since is a basis of , there exist such that
and the only possible poles in of the are the places and . Indeed, suppose that is a pole of for some . Note that for any place lying over , we have , which gives and . By [[7], Corollary 3.3.5] and Proposition 3.1.2 the integral closure of in is
Hence, , so each must belong to . This contradiction implies that the are of the form
where are integers, is a polynomial in , and does not divide for any . Thus, is a -linear combination of functions
for . In order to prove the theorem, it is sufficient to show that for and , the functions belong to . Let , , and . Since is the place defined by the irreducible polynomial , we have
On the other hand, by Proposition 3.1.4 , then
Now, for , we have that are distinct because they are distinct module . Thus,
since . Finally, for and , we obtain
It remains to establish We proceed in a similar way as before. Recalling , we get
(10) |
Now, for , the integers are distinct because they are distinct module . Then,
(11) |
because . On the other hand, for we have
(12) | |||||
Lemma 3.3 ([4], Lemma 3.5).
Let be a function field. Let be a divisor of , and let be a rational place of . Let . For each , choose such that Then the set is a basis for .
Theorem 3.4.
Consider the divisor on the function field defined by the equation (8) where for . Then the dimension of over is
with .
Proof.
For set
and let . The proof will be divided into several steps.
Step 1. .
Proof of step 1. Let a non-zero element . By Theorem 3.2, we have
where , is a nonnegative integer, each is an integer, for all , and . Thus, for any , we obtain
Conversely, let . Then for some . Hence,
where , , , and . Finally, if we choose
we have .
According to Lemma 3.3, it follows that . Therefore, we proceed to count the number of elements in . This will be the second step of the proof.
Step 2. Fix , Then if and only if
Proof of step 2. Firstly, we will prove that the sets are mutually disjoint. Let , then , where , so
Since , then , thus . This implies that
It remains to determine . Now fix , , and set where Then if and only if . This holds if and only if
for some integers and with
and
These inequalities are equivalent to
and
and
for any . Therefore, the integers and exist if and only if
Now it follows that is the number of integers in the interval
i.e.,
This implies that
∎
Corollary 3.5.
Consider the divisor on the function field defined by the equation (8) where for . Then
where each is defined as
is a basis for as a vector space over .
Corollary 3.6 ([7], Proposition 4.1 (h)).
Consider a function field with
. Assume that is relatively prime to and . Then a basis for the Riemann-Roch space is
Now, we recall the notion of the floor of a divisor. The floor of a divisor with , denoted , is the minimum degree divisor such that . The next result states that from a generator set of a Riemann–Roch space , we can calculate .
Lemma 3.7.
[[4], Theorem 2.6] Let be a divisor of , and let be a spanning set for . Then,
In order to conclude this section, we compute the floor of certain divisors of linearized function fields.
Theorem 3.8.
Let be a divisor of the function field defined by the equation (8) where for . The floor of is given by
with
and
and .
Proof.
By Corollary 3.5 , is a basis for , where each is the set
Suppose , is non-empty and consider . By Proposition 3.1.3, 4, and since the divisor of is and is an effective divisor, we have
Now, take with . Then
Observe that is non-empty if and only if . Therefore,
It remains to calculate . Similarly, choosing with and
we can see that
Thus,
and by Lemma 3.7, we obtain ∎
4 Examples
In this section, we show examples of GAG codes with good parameters. For this purpose, we choose divisors , , and such that , , and . Then
In this way, and satisfy the hypotheses of the Corollary 2.5, so we obtain lower bounds for minimum distance. We use Theorem 2.2 to calculate the dimension of the codes, Theorem 3.4 for the dimension of the Riemann–Roch spaces involved, and Theorem 3.8 for the floor of the divisors considered. All examples presented are improvements on MinT’s tables [5]. In examples 1–3, we consider the function field defined by the equation
In [2], it was proven that has genus and rational places. Also, it can be shown that it has many places of degree two and three. The only pole of and and the only pole of over the zero of in will be denoted by and , respectively.
Example 1.
Let , , , and , then .
-
1.
Taking and for , we obtain linear codes with parameters .
-
2.
Taking and for and for , we obtain linear codes with parameters .
-
3.
Taking and for and for , we obtain linear codes with parameters .
-
4.
Taking and for and for , we obtain linear codes with parameters .
-
5.
Taking and for and for , we obtain linear codes with parameters .
-
6.
Taking and for and for , we obtain linear codes with parameters .
-
7.
Taking and for and for , we obtain linear codes with parameters .
Example 2.
Let , , , and . Then .
-
1.
Taking and for , we obtain linear codes with parameters .
-
2.
Taking and for and for , we obtain linear codes with parameters .
-
3.
Taking and for and for , we obtain linear codes with parameters .
-
4.
Taking and for and for , we obtain linear codes with parameters .
Example 3.
Let , , and . Then .
-
1.
Taking and for , we obtain linear codes with parameters .
-
2.
Taking and for and for , we obtain linear codes with parameters .
-
3.
Taking and for and for , we obtain linear codes with parameters .
-
4.
Taking and for and for , we obtain linear codes with parameters .
-
5.
Taking and for and for , we obtain linear codes with parameters .
In example 4, we consider the function field defined by the equation
It can be proven that has genus , rational places and many places of degree three. The only pole of and will be denoted by .
Example 4.
Let , , and , then .
-
1.
Taking and for , we obtain linear codes with parameters .
-
2.
Taking and for and for , we obtain linear codes with parameters .
-
3.
Taking and for and for , we obtain linear codes with parameters .
-
4.
Taking and for and for , we obtain linear codes with parameters .
-
5.
Taking and for and for , we obtain linear codes with parameters .
References
- [1] A. Garzón and H. Navarro. Bases of Riemann–Roch spaces from Kummer extensions and algebraic geometry codes. Finite Fields and Their Applications, 80:102025, 2022.
- [2] Rohit Gupta, Erik AR Mendoza, and Luciane Quoos. Reciprocal polynomials and curves with many points over a finite field. Research in Number Theory, 9(3):60, 2023.
- [3] Agnes Eileen Heydtmann. Generalized geometric Goppa codes. Communications in Algebra, 30(6):2763–2789, 2002.
- [4] Hiren Maharaj, Gretchen L Matthews, and Gottlieb Pirsic. Riemann–Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences. Journal of Pure and Applied Algebra, 195(3):261–280, 2005.
- [5] MinT. Online database for optimal parameters of -nets, -sequences, orthogonal arrays, and linear codes.
- [6] Alberto Picone. New lower bounds for the minimum distance of generalized algebraic geometry codes. Journal of Pure and Applied Algebra, 217(6):1164–1172, 2013.
- [7] H. Stichtenoth. Algebraic function fields and codes, volume 254 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, 2009.
- [8] Chaoping Xing, H. Niederreiter, and Kwok Yan Lam. A generalization of algebraic-geometry codes. IEEE Transactions on Information Theory, 45(7):2498–2501, 1999.