Next Article in Journal
Chaos Control in Three Dimensional Cancer Model by State Space Exact Linearization Based on Lie Algebra
Previous Article in Journal
New Approach for Fractional Order Derivatives: Fundamentals and Analytic Properties
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Dimension of Algebraic-Geometric Trace Codes

1
Department of Mathematics and Computer Science, Goucher College, Baltimore, MD 21204, USA
2
Department of Mathematics, College of Saint Benedict and Saint John’s University, Collegeville, MN 56321, USA
*
Author to whom correspondence should be addressed.
Mathematics 2016, 4(2), 32; https://doi.org/10.3390/math4020032
Submission received: 29 January 2016 / Revised: 21 April 2016 / Accepted: 22 April 2016 / Published: 7 May 2016

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.

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 F , one can construct a subfield subcode by restriction (e.g., in the coordinates) to a subfield of F . 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 F q m -vector space of functions in a set of F q m -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 q = p r . Given a linear code C of length n over F q m , a trace code over F q is constructed from C by applying the trace map from F q m to F q coordinate-wise to the letters of the words of C. This q-ary code is denoted Tr q m / q C or simply Tr ( C ) if the base fields in question are clear.
Let X be a geometrically irreducible, non-singular projective curve of genus g defined over F q m . Consider F q m ( X ) the F q m -rational function field of X. Throughout, by a point Q on X we mean Q X ( F ¯ q ) is a geometric point defined over F ¯ q . A divisor G = n Q Q defined over F q m is a formal sum over points Q defined over F q m , and is invariant under the action of Gal ( F ¯ q / F q m ) . Any divisor G = n Q Q may be split into two divisors G + and G , where G + = n Q > 0 n Q Q and G = n Q < 0 n Q Q . Hence G = G + + G . The sum i n i of the coefficients of G is called the degree of G, denoted deg ( G ) . We denote the support of G to be Supp ( G ) : = { Q n Q 0 } .
Define L ( G ) to be the vector space of functions
L ( G ) = { f F q m ( X ) ( f ) + G 0 } { 0 }
To generate a code from L ( G ) we take a subset of n distinct F q m -rational points away from the support of the divisor G:
D : = { P 1 , , P n } X ( F q m ) \ Supp ( G )
For our purposes we will take D = X ( F q m ) \ Supp ( G ) the largest possible set.
We define our AG code to be
C : = C ( D , G ) = { ( f ( P 1 ) , , f ( P n ) ) , f L ( G ) }
When 2 g 2 < deg ( G ) , by Riemann-Roch we have
dim F q m L ( G ) = deg ( G ) + 1 g
Since deg ( G ) < n the evaluation map
L ( G ) F q n f ( f ( P 1 ) , , f ( P n ) )
is injective. Hence the dimension of C as an F q m -vector space is also k. In this way we identify f L ( G ) with its image in C.
An AG trace code is defined as the coordinate-wise application of the trace map
Tr ( C ) : = { ( Tr q m / q ( f ( P 1 ) ) , , Tr q m / q ( f ( P n ) ) ) , f L ( G ) }

2.2. Main Result

For r R , let [ r ] denote the greatest integer function. Consider the divisor
[ G / q ] : = n Q > 0 [ n Q / q ] Q + n Q < 0 n Q Q
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 Tr ( C ) .
Theorem 1. 
Let 2 g 2 deg ( [ G / q ] ) and deg ( G ) < n . Consider the following two conditions:
| Supp ( G ) | 1
| X ( F q m ) | > ( 2 g 2 + deg ( G + ) ) q m / 2 + | Supp ( G + ) | ( q m / 2 + 1 )
Under these conditions we have an exact formula for the dimension:
dim F q Tr C = m ( deg ( G ) deg ( [ G / q ] ) ) + δ
where
δ = 1 if d e g ( G ) 1 0 otherwise
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 q = p r for some prime p and r > 1 . 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 q = p r . Consider an elliptic curve E defined over F q m . A formula for counting points on E is given by
E ( F q m ) = q m + 1 π m π ¯ m
where π π ¯ = q and π + π ¯ = a p , the linear coefficient of the numerator of an associated zeta function as described in ([10], p. 301).
For G = k P we see that condition (2) is
q m / 2 π m + π ¯ m q m / 2 > k
Assuming this, Theorem 1 states that for any D such that | D | > deg ( G ) we have
dim F q Tr ( C ( D , G ) ) = m ( k [ k / q ] ) + 1
Example 2. 
For a smooth projective curve X defined over F q m , let G = k P for some positive integer k. Using the the Hasse-Weil bound we have
| | X ( F q m ) | ( q m + 1 ) | 2 g q m / 2
By condition (2) of Theorem 1 we must also require the inequality
| X ( F q m ) | > ( 2 g 2 + k ) q m / 2 + ( q m / 2 + 1 )
Combining these two inequalities, we see that condition (2) is satisfied when
q m / 2 4 g + 1 > k
Using Theorem 1 we obtain the following:
Corollary 2. 
For X a smooth projective curve over F q m and G = k P , if 2 g 2 [ k / q ] and k < min ( n , q m / 2 4 g + 1 ) then
dim F q Tr ( C ) = m ( k [ k / q ] ) + 1
Example 3. 
This is a generalization from an example in [7]. Let q = p r , X = P 1 and G = ( g ) 0 P where ( g ) 0 is the zero divisor of a polynomial g ( z ) F q m [ z ] which has no zeros in F q m . Denote the number of different zeros of g ( z ) by s. Furthermore, we take D = x F q m P x . From condition (2) we obtain the inequality
deg ( g ( z ) ) + s < q m + 1 q m + 2
Write g ( z ) = g 1 q g 2 , where g 1 ( z ) , g 2 ( z ) F q m [ z ] of degrees r 1 , r 2 respectively, and g 2 ( z ) q-th power free. With sufficiently many points as above, applying Theorem 1 we have
dim F q Tr ( C ( D , G ) ) = m ( ( q 1 ) r 1 + r 2 )

3. Proof of Main Result

Observe C is a vector space over F q m and Tr ( C ) is a vector space over F q . From this we have the bound
dim F q m C dim F q Tr ( C ) m ( d i m F q m C )
Using the F q -linearity of the trace map we have an exact sequence
0 K C Tr ( C ) 0
where K is the kernel of the trace map. Note the trace map defines an F q -linear subspace of C. Let K be the subspace of L ( G ) that is the inverse image of evaluation at D = { P 1 , , P n } . That is
K : = { f L ( G ) | ( f ( P 1 ) , , f ( P n ) ) K }
Notice that K is isomorphic to K as F q vector spaces. Therefore
m dim F q m C dim F q K = dim F q Tr ( C )
We can obtain the dimension of Tr ( C ) by determining dim F q K . In practice, this is difficult. Consider the space of functions
E : = { f = h q h f L ( G ) , h F q m ( X ) }
Using Bombieri’s estimate and a degree argument, we will determine a sufficient condition (condition 2 of Theorem 1) when K = E and E is isomorphic to K . 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 f = h q h L ( G ) , by definition ( h q h ) + G 0 . Counting with multiplicity, each pole in h corresponds to q poles in f. For h L ( [ G / q ] ) , we have h q h L ( G ) .
Consider the map ϕ : L ( [ G / q ] ) E where ϕ ( h ) = h q h . By definition, the kernel is F q L ( [ G / q ] ) . Note that for a general G the map φ is not surjective.
Lemma 3. 
When deg ( G ) 1 the map φ is surjective.
Proof. 
Recall that the divisor [ G / q ] only changes the positive coefficients of G and does not change G . When G = Ø , there is no restriction on zeros in L ( G ) . Therefore, in this case φ is onto.
If | Supp ( G ) | = 1 , then G = n p P for some point P X ( F q m ) and negative integer n p . Every function in L ( [ G / q ] ) must have a zero at P. In the factorization h q h = b F q ( h b ) , this zero must occur in at least one factor h b . Though h may not be in L ( [ G / q ] ) , there will always exist some b F q such that h b L ( [ G / q ] ) . Observe h q h = ( h b ) q ( h b ) = ϕ ( h b ) . In this case, φ is onto. ☐
If G = Ø , then the kernel of φ is F q . If G Ø , then φ is injective. Therefore the δ defined in Theorem 1 is merely δ = dim F q ker ϕ . Using Lemma 3, we have the following proposition.
Proposition 4. 
If d e g ( G ) 1 , then the sequence
0 F q L ( [ G / q ] ) L ( [ G / q ] ) ϕ E 0
is exact. Therefore we have a dimension formula for E:
dim F q E = dim F q L ( [ G / q ] ) dim F q ( F q L ( [ G / q ] ) )
In general, φ may not be surjective. There is still a dimension bound:
dim F q E dim F q L ( [ G / q ] ) dim F q ( F q L ( [ G / q ] ) )
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 K = E is a bound developed by Bombieri [8].
Theorem 5 
(Bombieri’s estimate). Let X be a complete, geometrically irreducible, nonsingular curve of genus g , defined over F q m . Let f F q m ( X ) , f h p h for h F ¯ q ( X ) , with pole divisor ( f ) on X. Then
P X ( F q m ) \ Supp ( f ) ζ p Tr q m / p ( f ( P ) ) ( 2 g 2 + t + deg ( f ) ) q m / 2
where ζ p = exp ( 2 π i / p ) is any primitive p-th root of unity and t is the number of distinct poles of f on X.
Let E ¯ = { f K f = h p h for some h F ¯ q ( X ) } . On this subspace of K the conditions of Bombieri’s Estimate are not met.
Lemma 6. 
E E ¯ .
Proof. 
Recall that q = p r . Therefore, for g q g E we have
g q g = g p r g = ( g p r 1 + + g ) p ( g p r 1 + + g )
Let h = g p r 1 + + g . From this we see clearly that g q g = h p h . ☐
Lemma 7. 
For each g F ¯ q ( X ) , there exists an h F q m ( X ) and c F q m such that g p g = h p h + c . Therefore,
E ¯ { f F q m ( X ) | f = h p h + c for some h F q m ( X ) , c F q m }
Proof. 
Suppose there is an f F q m ( X ) and an h F ¯ q ( X ) such that f = h p h . Consider σ = Frob q m , the coefficient-wise q m -Frobenius endomorphism on F ¯ q m . Observe
σ ( f ) = σ ( h p h ) = σ ( h p ) σ ( h ) = σ ( h ) p σ ( h )
Furthermore, σ ( f ) = f . Rearranging by exponents of p we see
σ ( h ) p σ ( h ) = h p h σ ( h ) p h p = σ ( h ) h ( σ ( h ) h ) p = σ ( h ) h
By considering the order of poles of σ ( h ) h , we determine that σ ( h ) h must be a constant a F p . There is a b in F ¯ q such that a = b q m b . Then σ ( b ) = b + a and σ ( h b ) = h + a ( b + a ) = h b . Therefore, h b F q m ( X ) . Let h 1 = h b . Observe f b p + b = h 1 p h 1 . Also, σ ( b p b ) = b p b , so b p b F q m . Therefore, f = h 1 p h 1 + b p b . ☐
Consider f K , and P D = X ( F q m ) \ Supp ( G ) as defined in our definition of the trace code. By the definition of K, we have Tr ( f ( P ) ) = 0 . Observe that if f K \ E ¯ then f satisfies the conditions of Bombieri’s Estimate. Hence, ζ p Tr ( f ( P ) ) = 1 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 | X ( F q ) \ ( f ) | . Hence for f K \ E ¯ , we have
P X ( F q m ) \ Supp ( f ) ζ p Tr q m / p ( f ( P ) ) = | ( X ( F q m ) \ ( f ) ) | ( 2 g 2 + t + deg ( f ) ) q m / 2
Observe t | Supp ( G + ) | and deg ( f ) deg ( G + ) . Using these two inequalities, we obtain a more general bound:
| X ( F q m ) | ( 2 g 2 + deg ( G + ) ) q m / 2 + | Supp ( G + ) | ( q m / 2 + 1 )
Proposition 8. 
If
| X ( F q m ) | > ( 2 g 2 + deg ( G + ) ) q m / 2 + | Supp ( G + ) | ( q m / 2 + 1 )
then K = E ¯ .
The condition presented in Proposition 8 is exactly condition (2) from Theorem 1.

3.3. E and E ¯

Recall the definitions of E and E ¯ :
E : = { f = h q h f L ( G ) , h F q m ( X ) }
E ¯ : = { f K f = h p h for some h F ¯ q ( X ) }
In the case presented in [7], Van der Vlugt had E ¯ = E . In the current more general case, Proposition 8 provides conditions forcing all elements of K to be of the form h p h , for h F ¯ q ( X ) . However, it may be that elements of this form that are not of the form g q g , with g F q m ( X ) . We will show that this is not the case and that condition (2) of Theorem 1 is sufficient to force K = E . It will be useful to develop our understanding of the interplay of K, E ¯ and E, and the nature of the degree of functions therein.
As is the case in Lemma 6, elements of the form g q g , for g F q m ( X ) , can also be written in the form h p h , for h F ¯ q ( X ) . Also notice that for any f K and y F q , the function y f is an element of K. Furthermore, for any f E and y F q , y f is in E. Consider the following:
Definition 9. 
For f F ¯ q ( X ) , let D ( f ) be the elements y F q such that y f = h p h , for some h F ¯ q ( X ) .
We see that for f K , when | D ( f ) | < q , there is a y such that y f K \ E ¯ .
Proposition 10. 
For f K , D ( f ) is an F p -subspace of F q .
Proposition 11. 
If D ( f ) = F q and D ( g ) = F q then D ( a f + b g ) = F q for each a , b F q .
Lemma 12. 
Let f = h p h 0 for some h F ¯ q ( X ) and D ( f ) { 0 } . Then
| D ( f ) | p | D ( h ) |
Proof. 
Let y D ( f ) , y 0 . Then y f = g p g for some g F ¯ q ( X ) . Hence
y f = g p g = y h p y h = ( y 1 / p h ) p ( y 1 / p h ) + ( y 1 / p h ) y h
Rearranging terms we see that
( y 1 / p y ) h = ( g p g ) ( ( y 1 / p h ) p ( y 1 / p h ) )
Therefore ( y 1 / p y ) is in D ( h ) . Hence, for every x , y D ( f ) , x 1 / p x and y 1 / p y are in D ( h ) . Suppose x y but x 1 / p x = y 1 / p y . Then
x 1 / p x = y 1 / p y ( x y ) 1 / p = ( x y ) ( x y ) = ( x y ) p
The only elements of F q equal to their own p th power are elements of F p . Hence x = y + t for some t F p . From this we see that D ( f ) / F p can be identified with a subgroup of D ( h ) . Hence | D ( f ) | p | D ( h ) | .  ☐
Definition 13. 
For f F q m ( X ) , define the p-linear degree of f, denoted e ( f ) , to be the largest possible integer such that f = a c + a 0 g + a 1 g p + + a e ( f ) g p e ( f ) , where a c , a 0 , , a e ( f ) F q m , g F q m ( X ) .
The following properties of e ( f ) are straightforward:
Proposition 14. 
1.
For f E ¯ , we have e ( f ) 1 . This is a restatement of Lemma 7.
2.
For g E , we have e ( g ) r .
3.
For a F q m * , b F q m , we have e ( f ) = e ( a f + b ) .
Proposition 15. 
Suppose f F q m ( X ) such that either e ( f ) = 0 or f = h p h , for some h F q ¯ ( X ) . Then we have the inequality:
| D ( f ) | p e ( f )
Proof. 
We proceed by induction on e ( f ) . Suppose e ( f ) = 0 . By Lemma 7, we have y f h p h + c , for any y F q m * , any h F q m ( X ) , and c F q m . Therefore D ( f ) = { 0 } and | D ( f ) | = 1 = p 0 = p e ( f ) = 1 .
Now consider a positive integer k and f F q m ( X ) such that e ( f ) = k . Without loss of generality, we may assume that | D ( f ) | > 1 . There is a nonzero y D ( f ) such that y f = h p h . Therefore, f = y 1 h p y 1 h . From this we obtain e ( f ) 1 + e ( h ) . Since e ( f ) = k we have e ( h ) < k . By the inductive hypothesis, | D ( h ) | p e ( h ) . Combining this with Lemma 12 we have
| D ( f ) | p | D ( h ) | = p e ( h ) + 1 p e ( f )
Corollary 16. 
If | D ( f ) | = q = p r , then e ( f ) r .
Proposition 17. 
Suppose condition (2) from Theorem 1 holds. That is, suppose
| X ( F q m ) | > ( 2 g 2 + deg ( G + ) ) q m / 2 + | Supp ( G + ) | ( q m / 2 + 1 )
If K E , then K \ E ¯ is nonempty.
Proof. 
Suppose K E and D ( f ) = F q for each f K \ E . Such an f F q m ( X ) cannot be constant. Choose f K \ E with the least number of poles. In other words, deg ( f ) is minimal and positive. Applying Corollary 16, there is some l Z 0 , h F q m ( X ) and a c , a 1 , , a r + l F q m such that
f = a r + l h p r + l + a r + l 1 h p r + l 1 + + a 1 h + a c
This may be rewritten as
f = f E + f 1
where
f E = ( a r + l h p l ) q ( a r + l h p l ) ,
f 1 = ( a r + l h p l ) + a r + l 1 h p r + l 1 + + a 1 h + a c F q m ( X )
Observe f E K and D ( f E ) = F q . Hence f 1 = f f E K . By Proposition 11, D ( f 1 ) = F q . But
deg ( f 1 ) p r + l 1 · deg ( h )
and
deg ( f ) = p r + l deg ( h )
This contradicts the choice of an f with minimal poles. Hence, when K E , we can choose an f K not of the form h p h . ☐

4. Conclusions

Proof of Theorem 1. 
Let 2 g 2 deg ( [ G / q ] ) , deg ( G ) < n and also assume condition (1) and condition (2).
By condition (2), Proposition 8 and Proposition 17, we see that K = E . Then, using condition (1) and Proposition 4, we compute the dimension of E. We apply this to Equation (3) to obtain Theorem 1, a dimension formula for algebraic-geometric trace codes, as desired. ☐

Author Contributions

Both authors contributed equally to this work.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Katsman, G.; Tsafsman, M. A remark on algebriac geometric codes. Contemp. Math. 1989, 93, 197–200. [Google Scholar]
  2. Wirtz, M. On the parameters of Goppa codes. IEEE Trans. Inform. Theory 1988, 34, 1341–1343. [Google Scholar] [CrossRef]
  3. Stichtenoth, H. On the dimension of subfield subcodes. IEEE Trans. Inform. Theory 1990, 36, 90–93. [Google Scholar] [CrossRef]
  4. Delsarte, P. On the subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inform. Theory 1975, 21, 575–576. [Google Scholar] [CrossRef]
  5. 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]
  6. Véron, P. True dimension of some binary quadratic trace Goppa codes. Des. Codes Cryptogr. 2001, 24, 81–97. [Google Scholar] [CrossRef]
  7. 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]
  8. Bombieri, E. Exponential sums in finite fields. Am. J. Math. 1966, 88, 71–105. [Google Scholar] [CrossRef]
  9. Stichtenoth, H. Algebraic Function Fields and Codes; Springer-Verlag: Berlin, Germany, 1993. [Google Scholar]
  10. Ireland, K.; Rosen, M. A Classical Introduction to Modern Number Theory; Springer-Verlag: Berlin, Germany, 1998. [Google Scholar]

Share and Cite

MDPI and ACS Style

Le, P.; Chetty, S. On the Dimension of Algebraic-Geometric Trace Codes. Mathematics 2016, 4, 32. https://doi.org/10.3390/math4020032

AMA Style

Le P, Chetty S. On the Dimension of Algebraic-Geometric Trace Codes. Mathematics. 2016; 4(2):32. https://doi.org/10.3390/math4020032

Chicago/Turabian Style

Le, Phong, and Sunil Chetty. 2016. "On the Dimension of Algebraic-Geometric Trace Codes" Mathematics 4, no. 2: 32. https://doi.org/10.3390/math4020032

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop