Abstract
We study trace codes induced from codes defined by an algebraic curve X. We determine conditions on X which admit a formula for the dimension of such a trace code. Central to our work are several dimension reducing methods for the underlying functions spaces associated to X.
MSC:
11T71
1. Introduction
Many good error correcting codes defined over a finite field can be constructed from other codes using the trace map. More generally, given a code C over a finite field , one can construct a subfield subcode by restriction (e.g., in the coordinates) to a subfield of . In [1], Katsman and Tsfasman prove that one can often obtain better parameters than those guaranteed by trivial bounds. Precise lower bounds on the dimension of subfield subcodes have been given in, e.g., [1,2,3]. Delsarte’s Theorem [4] is used to describe subfield subcodes as trace codes. BCH-codes, classical and generalized Goppa codes, and alternant codes can all be realized as the dual of trace codes.
Algebraic-geometric (AG) codes arise from the evaluation of the elements of an -vector space of functions in a set of -rational points on a curve X. We shall consider trace codes associated to algebraic-geometric codes. In some cases the exact dimension can be determined. As in [5,6] a key ingredient in the present work is understanding the kernel of the trace map. Our use of Bombieri’s estimate, following [7], and consideration of a more general class of codes differ from the methods and setting of [5,6].
The main result, Theorem 1, is an extension of results that appear in [7]. The bound in [7] applies for trace maps from the original field to the prime field. We modify this to include trace maps to intermediate fields. Significant modifications of the original proof are needed to accommodate the more general trace in the execution of Bombieri’s estimate for exponential sums [8]. The primary modification is summarised in Proposition 17.
For a general introduction on AG codes and trace codes, see [9].
2. Definition of Code and Main Result
2.1. Background
Let p be a prime number and . Given a linear code C of length n over , a trace code over is constructed from C by applying the trace map from to coordinate-wise to the letters of the words of C. This q-ary code is denoted or simply if the base fields in question are clear.
Let X be a geometrically irreducible, non-singular projective curve of genus defined over . Consider the -rational function field of X. Throughout, by a point Q on X we mean is a geometric point defined over . A divisor defined over is a formal sum over points Q defined over , and is invariant under the action of Gal. Any divisor may be split into two divisors and , where and . Hence . The sum of the coefficients of G is called the degree of G, denoted . We denote the support of G to be .
Define to be the vector space of functions
To generate a code from we take a subset of n distinct -rational points away from the support of the divisor G:
For our purposes we will take the largest possible set.
We define our AG code to be
When , by Riemann-Roch we have
Since the evaluation map
is injective. Hence the dimension of C as an -vector space is also k. In this way we identify with its image in C.
An AG trace code is defined as the coordinate-wise application of the trace map
2.2. Main Result
For , let denote the greatest integer function. Consider the divisor
That is, we are dividing the positive coefficients by q and rounding down to the nearest integer. We are in a sense dividing the pole part of G by q. This construction will be useful in determining the kernel of the trace map.
Section 3 is devoted to the proof of the following dimension formula for .
Theorem 1.
Let and . Consider the following two conditions:
Under these conditions we have an exact formula for the dimension:
where
If q is a prime number, this theorem reduces to the main result of [7]. Theorem 1 is applicable for a more general trace when for some prime p and . In this setting, complications arise in the dimension reducing argument using Bombieri’s estimate used in [7]. Bombieri’s estimate alone does not collapse the dimension of the kernel of the trace map enough. We have addressed these complications with the addition of a degree argument that shows that the kernel can be reduced in a way that aligns with the result in [7].
2.3. Examples
Example 1.
Let . Consider an elliptic curve E defined over . A formula for counting points on E is given by
where and , the linear coefficient of the numerator of an associated zeta function as described in ([10], p. 301).
For we see that condition (2) is
Assuming this, Theorem 1 states that for any D such that we have
Example 2.
For a smooth projective curve X defined over , let for some positive integer k. Using the the Hasse-Weil bound we have
By condition (2) of Theorem 1 we must also require the inequality
Combining these two inequalities, we see that condition (2) is satisfied when
Using Theorem 1 we obtain the following:
Corollary 2.
For X a smooth projective curve over and , if and then
Example 3.
This is a generalization from an example in [7]. Let , and where is the zero divisor of a polynomial which has no zeros in . Denote the number of different zeros of by s. Furthermore, we take . From condition (2) we obtain the inequality
Write , where of degrees respectively, and q-th power free. With sufficiently many points as above, applying Theorem 1 we have
3. Proof of Main Result
Observe C is a vector space over and is a vector space over . From this we have the bound
Using the -linearity of the trace map we have an exact sequence
where is the kernel of the trace map. Note the trace map defines an -linear subspace of C. Let K be the subspace of that is the inverse image of evaluation at . That is
Notice that is isomorphic to K as vector spaces. Therefore
We can obtain the dimension of by determining . In practice, this is difficult. Consider the space of functions
Using Bombieri’s estimate and a degree argument, we will determine a sufficient condition (condition 2 of Theorem 1) when and E is isomorphic to . But to make this useful we will first show Theorem 1 is sufficient to determine the dimension of E.
3.1. Dimension of E
For , by definition . Counting with multiplicity, each pole in h corresponds to q poles in f. For , we have .
Consider the map where . By definition, the kernel is . Note that for a general G the map φ is not surjective.
Lemma 3.
When the map φ is surjective.
Proof.
Recall that the divisor only changes the positive coefficients of G and does not change . When , there is no restriction on zeros in . Therefore, in this case φ is onto.
If , then for some point and negative integer . Every function in must have a zero at P. In the factorization , this zero must occur in at least one factor . Though h may not be in , there will always exist some such that . Observe . In this case, φ is onto. ☐
If , then the kernel of φ is . If , then φ is injective. Therefore the δ defined in Theorem 1 is merely . Using Lemma 3, we have the following proposition.
Proposition 4.
If , then the sequence
is exact. Therefore we have a dimension formula for E:
In general, φ may not be surjective. There is still a dimension bound:
Note in [7], a similar result is obtained with the use of group cohomology and other auxillary constructions.
3.2. Bombieri’s Estimate
A key step in determining when is a bound developed by Bombieri [8].
Theorem 5
(Bombieri’s estimate). Let X be a complete, geometrically irreducible, nonsingular curve of genus , defined over . Let for , with pole divisor on X. Then
where is any primitive p-th root of unity and t is the number of distinct poles of f on X.
Let . On this subspace of K the conditions of Bombieri’s Estimate are not met.
Lemma 6.
.
Proof.
Recall that . Therefore, for we have
Let . From this we see clearly that . ☐
Lemma 7.
For each , there exists an and such that . Therefore,
Proof.
Suppose there is an and an such that . Consider , the coefficient-wise -Frobenius endomorphism on . Observe
Furthermore, . Rearranging by exponents of p we see
By considering the order of poles of , we determine that must be a constant . There is a b in such that . Then and . Therefore, . Let . Observe . Also, , so . Therefore, . ☐
Consider , and as defined in our definition of the trace code. By the definition of K, we have . Observe that if then f satisfies the conditions of Bombieri’s Estimate. Hence, for each P. For such f, each term of the sum in the left-hand-side in Theorem 5 contributes 1. This is a total contribution of . Hence for , we have
Observe and . Using these two inequalities, we obtain a more general bound:
Proposition 8.
If
then .
The condition presented in Proposition 8 is exactly condition (2) from Theorem 1.
3.3. E and
Recall the definitions of E and :
In the case presented in [7], Van der Vlugt had . In the current more general case, Proposition 8 provides conditions forcing all elements of K to be of the form , for . However, it may be that elements of this form that are not of the form , with . We will show that this is not the case and that condition (2) of Theorem 1 is sufficient to force . It will be useful to develop our understanding of the interplay of K, and E, and the nature of the degree of functions therein.
As is the case in Lemma 6, elements of the form , for , can also be written in the form , for . Also notice that for any and , the function is an element of K. Furthermore, for any and , is in E. Consider the following:
Definition 9.
For , let be the elements such that , for some .
We see that for , when , there is a y such that .
Proposition 10.
For , is an -subspace of .
Proposition 11.
If and then for each .
Lemma 12.
Let for some and . Then
Proof.
Let , . Then for some . Hence
Rearranging terms we see that
Therefore is in . Hence, for every , and are in . Suppose but . Then
The only elements of equal to their own power are elements of . Hence for some . From this we see that can be identified with a subgroup of . Hence ☐
Definition 13.
For , define the p-linear degree of f, denoted , to be the largest possible integer such that , where , .
The following properties of are straightforward:
Proposition 14.
- 1.
- For , we have . This is a restatement of Lemma 7.
- 2.
- For , we have .
- 3.
- For , we have .
Proposition 15.
Suppose such that either or , for some . Then we have the inequality:
Proof.
We proceed by induction on . Suppose . By Lemma 7, we have , for any , any , and . Therefore and .
Now consider a positive integer k and such that . Without loss of generality, we may assume that . There is a nonzero such that . Therefore, . From this we obtain . Since we have . By the inductive hypothesis, . Combining this with Lemma 12 we have
☐
Corollary 16.
If , then .
Proposition 17.
Suppose condition (2) from Theorem 1 holds. That is, suppose
If , then is nonempty.
Proof.
Suppose and for each . Such an cannot be constant. Choose with the least number of poles. In other words, is minimal and positive. Applying Corollary 16, there is some , and such that
This may be rewritten as
where
Observe and . Hence . By Proposition 11, . But
and
This contradicts the choice of an f with minimal poles. Hence, when , we can choose an not of the form . ☐
4. Conclusions
Proof of Theorem 1.
Author Contributions
Both authors contributed equally to this work.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Katsman, G.; Tsafsman, M. A remark on algebriac geometric codes. Contemp. Math. 1989, 93, 197–200. [Google Scholar]
- Wirtz, M. On the parameters of Goppa codes. IEEE Trans. Inform. Theory 1988, 34, 1341–1343. [Google Scholar] [CrossRef]
- Stichtenoth, H. On the dimension of subfield subcodes. IEEE Trans. Inform. Theory 1990, 36, 90–93. [Google Scholar] [CrossRef]
- Delsarte, P. On the subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inform. Theory 1975, 21, 575–576. [Google Scholar] [CrossRef]
- Hernando, F.; Marshall, K.; O’Sullivan, M. The dimension of subcode-subfields of shortened generalized Reed-Solomon codes. Des. Codes Cryptogr. 2013, 69, 131–142. [Google Scholar] [CrossRef]
- Véron, P. True dimension of some binary quadratic trace Goppa codes. Des. Codes Cryptogr. 2001, 24, 81–97. [Google Scholar] [CrossRef]
- Van der Vlugt, M. A new upper bound for the dimension of trace codes. Bull. Lond. Math. Soc. 1991, 23, 395–400. [Google Scholar] [CrossRef]
- Bombieri, E. Exponential sums in finite fields. Am. J. Math. 1966, 88, 71–105. [Google Scholar] [CrossRef]
- Stichtenoth, H. Algebraic Function Fields and Codes; Springer-Verlag: Berlin, Germany, 1993. [Google Scholar]
- Ireland, K.; Rosen, M. A Classical Introduction to Modern Number Theory; Springer-Verlag: Berlin, Germany, 1998. [Google Scholar]
© 2016 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC-BY) license (http://creativecommons.org/licenses/by/4.0/).