Ternary Codes Associated with $O(3,3^r)$ and Power Moments of Kloosterman Sums with Trace Nonzero Square Arguments
Dae San Kim

TL;DR
This paper constructs ternary linear codes linked to orthogonal groups over finite fields of characteristic three and derives recursive formulas for power moments of Kloosterman sums with specific trace conditions.
Contribution
It introduces new ternary codes associated with $SO(3,q)$ and $O(3,q)$ and establishes recursive formulas for Kloosterman sum moments using these codes.
Findings
Recursive formulas for Kloosterman sum moments derived
Explicit expressions of Gauss sums for orthogonal groups used
Codes constructed for orthogonal groups over finite fields of characteristic three
Abstract
In this paper, we construct two ternary linear codes and , respectively associated with the orthogonal groups and . Here is a power of three. Then we obtain two recursive formulas for the power moments of Kloosterman sums with trace nonzero square arguments" in terms of the frequencies of weights in the codes. This is done via Pless power moment identity and by utilizing the explicit expressions of Gauss sums for the orthogonal groups.
Peer Reviews
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
\begin{array}[]{c}\text{Ternary Codes Associated with O(3,3^{r})$ and }\
\text{Power Moments of Kloosterman Sums with}\ \text{Trace Nonzero Square Arguments}\end{array}$
dae san kim
Department of Mathematics, Sogang University, Seoul 121-742, Korea Department of Mathematics, Sogang University, Seoul 121-742, Korea [email protected]
Abstract.
In this paper, we construct two ternary linear codes and , respectively associated with the orthogonal groups and . Here is a power of three. Then we obtain two recursive formulas for the power moments of Kloosterman sums with trace nonzero square arguments” in terms of the frequencies of weights in the codes. This is done via Pless power moment identity and by utilizing the explicit expressions of Gauss sums for the orthogonal groups.
Index terms - power moment, Kloosterman sum, trace nonzero square argument, orthogonal group, Pless power moment identity, weight distribution, Gauss sum.
MSC 2000: 11T23, 20G40, 94B05.
2000 Mathematics Subject Classification:
This work was supported by National Research Foundation of Korea Grant funded by the Korean Government 2009-0072514.
1. Introduction
Let be a nontrivial additive character of the finite field with elements ( a prime). Then the Kloosterman sum ([11]) is defined by
[TABLE]
The Kloosterman sum was introduced in 1926([10]) to give an estimate for the Fourier coefficients of modular forms.
For each nonnegative integer , by we will denote the -th moment of the Kloosterman sum . Namely, it is given by
[TABLE]
If is the canonical additive character of , then will be simply denoted by .
Explicit computations on power moments of Kloosterman sums were begun with the paper [16] of Sali in 1931, where he showed, for any odd prime ,
[TABLE]
Here , and, for ,
[TABLE]
For odd prime, Sali obtained , , , in [16] by determining , , . On the other hand, can be expressed in terms of the -th eigenvalue for a weight newform on (cf. [12], [15]). can be expressed in terms of the -th eigenvalue for a weight newform on (cf.[3]). Also, based on numerical evidence, in [1] Evans was led to propose a conjecture which expresses in terms of Hecke eigenvalues for a weight newform on with quartic nebentypus of conductor 105.
From now on, let us assume that . Recently, Moisio was able to find explicit expressions of , for (cf. [14]). This was done, via Pless power moment identity, by connecting moments of Kloosterman sums and the frequencies of weights in the ternary Melas code of length , which were known by the work of Geer, Schoof and Vlugt in [2].
In order to describe our results, we introduce three incomplete power moments of Kloosterman sums. For every nonnegative integer , and as before, we define
[TABLE]
which will be respectively called the -th moment of Kloosterman sums with trace zero square arguments” and those with trace nonzero square arguments.” Then, clearly we have
[TABLE]
where
[TABLE]
which is called the -th moment of Kloosterman sums with square arguments.” If is the canonical additive character of , then , , and will be respectively denoted by , and , for brevity.
We derived recursive formulas generating the odd power moments of Kloosterman sums with trace one arguments in [7] and [8]. To do that we constructed binary linear codes associated with and with double cosets with respect to certain maximal parabolic subgroup of .
In this paper, we will show the main Theorem 1.1 giving recursive formulas for the power moments of Kloosterman sums with trace nonzero square arguments.” To do that, we construct ternary linear codes and , respectively associated with the orthogonal groups and , and express those power moments in terms of the frequencies of weights in the codes. Then, thanks to our previous results on the explicit expressions of Gauss sums” for the orthogonal group [6], we can express the weight of each codeword in the duals of the codes in terms of Kloosterman sums. Then our formulas will follow immediately from the Pless power moment identity.
Henceforth, we agree that, for nonnegative integers ,
[TABLE]
and
[TABLE]
Theorem 1.1**.**
Let . Then we have the following.
* For *
[TABLE]
where , and and are respectively the weight distributions of and given by: for ,
[TABLE]
[TABLE]
Here the first sum in (1.6) is 0 if and the unspecified sums in (1.7) and (1.8) run over all the sets of nonnegative integers and satisfying
[TABLE]
In addition, is the Stirling number of the second kind defined by
[TABLE]
* For *
[TABLE]
where , and is the weight distribution of given by: for ,
[TABLE]
Here the first sum in (1.10) is 0 if , the unspecified sum in (1.11) runs over all the sets of nonnegative integers and satisfying
[TABLE]
* indicates the Stirling number of the second as in (1.9), ’s are as in (1.8), and*
[TABLE]
2.
For more details about the results of this section, one is referred to the paper [6]. Throughout this paper, the following notations will be used:
[TABLE]
The orthogonal group is defined as:
[TABLE]
where
[TABLE]
It consists of the matrices
[TABLE]
in satisfying the relations:
[TABLE]
Let be the maximal parabolic subgroup of given by
[TABLE]
and let be the subgroup of of index 2 defined by
[TABLE]
Then we see that
[TABLE]
with
[TABLE]
Let denote the following matrix in
[TABLE]
Then the Bruhat decomposition of with respect to is given by
[TABLE]
which can further be modified as
[TABLE]
with
[TABLE]
The special orthogonal group is defined as
[TABLE]
Then we see from (2.1) that
[TABLE]
The sympletic group is defined as:
[TABLE]
with
[TABLE]
As is well-known or mentioned in [4] and [6],
[TABLE]
[TABLE]
For integers , with , the -binomial coefficients are defined as:
[TABLE]
It is shown in [6] that
[TABLE]
3. Gauss sums for
The following notations will be employed throughout this paper.
[TABLE]
Then any nontrivial additive character of is given by , for a unique . Also, since for any is a 3th root of 1, we have
[TABLE]
For any nontrivial additive character of and , the Kloosterman sum for is defined as
[TABLE]
Observe that, for , denotes the Kloosterman sum .
In [4], it is shown that satisfies the following recursive relation: for integers , ,
[TABLE]
where we understand that .
Proposition 3.1**.**
[6]* Let be a nontrivial additive character of . For each positive integer , let be the set of all nonsingular symmetric matrices over . Then we have*
[TABLE]
From [4] and [6], the Gauss sums for and are respectively equal to times that for and times that for . Indeed, using the decomposition in (2.2), for any nontrivial additive character of , it is shown that
[TABLE]
Similarly, from the decomposition in (2.1) it is shown in [6] that
[TABLE]
For our purposes, we only need the following expressions of Gauss sums for and . So we state them separately as a theorem. Also, for the ease of notations, we introduce
[TABLE]
Theorem 3.2**.**
Let be any nontrivial additive character of . Then we have
[TABLE]
The next corollary follows from Theorem 3.1 and by simple change of variables.
Corollary 3.3**.**
Let be the canonical additive character of , and let . Then we have
[TABLE]
[TABLE]
Proposition 3.4**.**
[5]**, 5.3-5)$$) Let be the canonical additive character of , , . Then
[TABLE]
where, for ,
[TABLE]
and
[TABLE]
Remark 3.5*.*
Here one notes that
[TABLE]
Let be one of finite classical groups over . Then we put, for each ,
[TABLE]
Then it is easy to see that
[TABLE]
For brevity, we write
[TABLE]
Using (3.3)-(3.5), and (4.1), one derives the following.
Proposition 3.6**.**
With the notations in (3.6), (3.7), and (3.9), we have:
[TABLE]
[TABLE]
Corollary 3.7**.**
, and are surjective.
Proof.
This is immediate from the above Proposition 3.6. ∎
4. Construction of codes
Let
[TABLE]
Here we will construct ternary linear codes of length and of length , respectively associated with the orthogonal groups and . By abuse of notations, let be a fixed ordering of the elements in the group , for .
Also, we put
[TABLE]
Then the ternary linear code is defined as
[TABLE]
where the dot denotes the usual inner product in .
The following theorem of Delsarte is well-known.
Theorem 4.1**.**
[13]* Let B be a linear code over . Then*
[TABLE]
In view of this theorem, the dual is given by
[TABLE]
Proposition 4.2**.**
For every , the map is an -linear isomorphism, for .
Proof.
The maps are clearly -linear and surjective. Let be in the kernel of either of the map. Then, in view of Corollary 3.7, , for all . Since the trace function is surjective, . ∎
5. Power moments of Kloosterman sums with trace nonzero square arguments
In this section, we will be able to find, via Pless power moment identity, recursive formulas for the power moments of Kloosterman sums with trace nonzero square arguments in terms of the frequencies of weights in and .
Theorem 5.1**.**
Pless power moment identity, [13] Let be an -ary code, and let (resp. ) denote the number of codewords of weight in (resp. in ). Then, for
[TABLE]
where is the Stirling number of the second kind defined in (1.9).
Lemma 5.2**.**
Let , for , and . Then the Hamming weight can be expressed as follows:
[TABLE]
Proof.
For
[TABLE]
Our results now follow from (3.1), (3.3), (3.4) and (4.1). ∎
Fix , and let , with 1’s and 2’s in the coordinate places where , for each . Then we see from the definition of the code (cf. (4.2)) that is a codeword with weight if and only if and (an identity in ). Note that there are (cf. (1.4), (1.5)) many such codewords with weight . Now, we get the following formulas in (5.3)-(5.4), by using the explicit values of in (3.10),(3.11)(cf. (3.6), (3.7)).
Theorem 5.3**.**
Let be as before, and let be the weight distribution of , for Then
**
[TABLE]
with
[TABLE]
**
[TABLE]
with
[TABLE]
Here in both (5.3) and (5.4) the unspecified sums run over all the sets of nonnegative integers and satisfying
[TABLE]
and, for every , is as in (3.7).
The recursive formula in the following theorem follows from the study of ternary linear codes associated with the symplectic group . It is slightly modified from its original version, which makes it more usable in below.
Theorem 5.4**.**
[9]* For ,*
[TABLE]
where , indicates the Stirling number of the second kind as in (1.9), and denotes the weight distribution of the ternary linear code , given by
[TABLE]
*.
Here the sum is over all the sets of nonnegative integers and satisfying and .*
We are now ready to apply the Pless power moment identity in (5.1) to for , in order to obtain the result in Theorem 1.1(cf. (1.6)-(1.8), (1.10)-(1.12)) about recursive formulas. We do this for at the same time.
The left hand side of that identity in (5.1) is equal to
[TABLE]
with the given by (5.2).
In below, the sum over (resp. )” will mean the sum over all with (resp. ).”
(5.6) is given by
[TABLE]
[TABLE]
On the other hand, the right hand side of (5.1) is
[TABLE]
Here one has to note that (cf. Prop. 4.2) and to separate the term corresponding to of the second sum in (5.7). Our main results in Theorem 1.1 now follow by equating (5.7) and (5.8).
Corollary 5.5**.**
Let . Then we have the following.
- (1)
, 2. (2)
, 3. (3)
.
Proof.
From either (1.6) or (1.10), we get (3). (1) follows from our previous result ([9], (4)) or can be derived directly as follows.
[TABLE]
[TABLE]
[TABLE]
In (5.9), we note that has a solution in if and only if -1 is a square in if and only if is even, in which case there are two distinct solutions. Finally, (2) follows from the relation (1.2) with and . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R.J. Evans, Seventh power moments of Kloosterman sums , Israel J. Math., to appear.
- 2[2] G. van der Geer, R. Schoof and M. van der Vlugt, Weight formulas for ternary Melas codes , Math. Comp. Math. 58 (1992), 781–792.
- 3[3] K. Hulek, J. Spandaw, B. van Geemen and D. van Straten, The modulartiy of the Barth-Nieto quintic and its relatives , Adv. Geom. 1 (2001), 263–289.
- 4[4] D. S. Kim, Gauss sums for symplectic groups over a finite field , Mh. Math. 126 (1998), 55–71.
- 5[5] D. S. Kim, Exponential sums for symplectic groups and their apllications , Acta Arith. 88 (1999), 155–171.
- 6[6] D. S. Kim, Gauss sums for O ( 2 n + 1 , q ) 𝑂 2 𝑛 1 𝑞 O(2n+1,q) , Finite Fields Appl. 4 (1998), 62–86.
- 7[7] D. S. Kim, Codes associated with O ( 3 , 2 r ) 𝑂 3 superscript 2 𝑟 O(3,2^{r}) and power moments of Kloosterman sums with trace one arguments , submitted.
- 8[8] D. S. Kim, An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: O ( 2 n + 1 , 2 r ) 𝑂 2 𝑛 1 superscript 2 𝑟 O(2n+1,2^{r}) case , submitted.
