Ternary Codes Associated with O^-(2n,q) and Power Moments of Kloosterman Sums with 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 square arguments using these codes.
Contribution
It introduces new ternary codes associated with orthogonal groups and provides recursive formulas for Kloosterman sum moments based on these codes.
Findings
Recursive formulas for power moments of Kloosterman sums derived.
Explicit expressions of Gauss sums for orthogonal groups utilized.
Codes constructed for groups O^-(2,q), SO^-(2,q), and SO^-(4,q).
Abstract
In this paper, we construct three ternary linear codes associated with the orthogonal group O^-(2,q) and the special orthogonal groups SO^-(2,q) and SO^-(4,q). Here q is a power of three. Then we obtain recursive formulas for the power moments of Kloosterman sums with square arguments and for the even power moments of those 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 and special orthogonal groups O^-(2n,q) and SO^-(2n,q).
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 · Analytic Number Theory Research · Finite Group Theory Research
\begin{array}[]{c}\text{Ternary Codes Associated with O^{-}(2n,q)$ and }\
\text{ Power Moments of Kloosterman Sums with 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 three ternary linear codes associated with the orthogonal group and the special orthogonal groups and . Here is a power of three. Then we obtain recursive formulas for the power moments of Kloosterman sums with square arguments and for the even power moments of those 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 and special orthogonal groups and .
Key words-ternary linear code, power moment, Kloosterman sum, square argument, Pless power moment identity, Gauss sum, orthogonal group, weight distribution.
MSC 2000: 11T23, 20G40, 94B05.
Mathematics Subject Classification:
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]
For this, we have the Weil bound
[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 .
Also, we introduce an incomplete power moments of Kloosterman sums. Namely, for every nonnegative integer , and as before, we define
[TABLE]
which is called the -th moment of Kloosterman sums with “square arguments”. If is the canonical additive character of , then will be denoted by , for brevity.
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 3 newform on (cf. [12], [15]). can be expressed in terms of the -th eigenvalue for a weight 4 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 3 newform on with quartic nebentypus of conductor 105.
Assume now 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 this paper, we will be able to produce three recursive formulas generating power moments of Kloosterman sums with square arguments over finite fields of characteristic three. To do that, we will construct three ternary linear codes , , and , respectively associated with , , and , and express those power moments in terms of the frequencies of weights in each code. Then, thanks to our previous results on the explicit expressions of “Gauss sums” for the orthogonal and special orthogonal groups and , we can express the weight of each codeword in the duals of the codes in terms of Kloosterman sums with square arguments. Then our formulas will follow immediately from the Pless power moment identity (cf. (5.1)). Similar results of this paper were obtained in [9] for the case of finite symplectic groups over finite fields of characteristic three. Also, in the same case infinite families of recursive formulas were derived in [8] by using explicit expressions of exponential sums associated with certain double cosets.
Theorem 1.1 in the following (cf. (1.5), (1.6), (1.8)-(1.12)) is the main result of this paper. Henceforth, we agree that, for nonnegative integers , , ,
[TABLE]
and
[TABLE]
Theorem 1.1**.**
*Let . Then we have the following.
For =1,2,,*
[TABLE]
where , and is the weight distribution of the ternary linear code given by
[TABLE]
Here the sum is over all the sets of nonnegative integers and satisfying
[TABLE]
and
[TABLE]
In addition, is the Stirling number of the second kind defined by
[TABLE]
* For *
[TABLE]
*where , and is the weight distribution of the ternary linear code given by:
For even,*
[TABLE]
*Here the sum is over all the sets of nonnegative integers
and satisfying*
[TABLE]
and
[TABLE]
* For odd,*
[TABLE]
*Here the sum is over all the sets of nonnegative integers
and satisfying*
[TABLE]
and
[TABLE]
* For *
[TABLE]
*where , and is the weight distribution
of the ternary linear code given by*
[TABLE]
Here the sum runs over all the sets of nonnegative integers and satisfying and , and, for every , .
2.
For more details about this section, one is referred to the paper [4] and [5]. Throughout this paper, the following notations will be used:
[TABLE]
The orthogonal group over the field is defined as:
[TABLE]
where
[TABLE]
and is a fixed element in , here and throughout this paper.
For convenience, we put
[TABLE]
Then consists of all matrices
[TABLE]
in satisfying the relations:
[TABLE]
The special orthogonal group over the field is defined as:
[TABLE]
which is a subgroup of index 2 in .
In particular, we have
[TABLE]
[TABLE]
with
[TABLE]
Let be the maximal parabolic subgroup of given by
[TABLE]
and let be the subgroup of of index 2 defined by
[TABLE]
From (2.2), we see that
[TABLE]
with
[TABLE]
The Bruhat decomposition of with respect to is given by
[TABLE]
which can be modified to give
[TABLE]
with
[TABLE]
Here denotes the following matrix in
[TABLE]
One can also show that
[TABLE]
where, for integers , with , the -binomial coefficients are defined as:
[TABLE]
Taking the decomposition in (2.3) into consideration, we see that (2.4) can further be modified as
[TABLE]
and
[TABLE]
As is well-known or mentioned in [4], we have
[TABLE]
[TABLE]
In particular, from (2.7) and (2.8), we have
[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
For any nontrivial additive character of and , the Kloosterman sum for is defined as
[TABLE]
Notice that, for , denotes the Kloosterman sum .
In [6], it is shown that satisfies the following recursive relation: for integers , ,
[TABLE]
where we understand that .
Proposition 3.1**.**
[4]* Let be a nontrivial additive character of . For each positive integer , let be the set of all nonsingular symmetric matrices over . Then, with as in (2.1), we have*
[TABLE]
Proposition 3.2**.**
[5]* Let be a nontrivial additive character of . Then*
- (1)
[TABLE] 2. (2)
[TABLE] 3. (3)
[TABLE]
where
[TABLE]
In Section 5 of [4], it is shown that the Gauss sum for is given by:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Also, from Section 6 of [4] the Gauss sum for is given by:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Note here that the results in Proposition 3.2 are incorporated in (3.2) and (3.3).
For our purposes, we only need the following three expressions of the Gauss sums for , , and . So we state them separately as a theorem which follows from (3.1)-(3.3) by a simple change of variables. Also, for the ease of notations, we introduce
[TABLE]
Theorem 3.3**.**
Let be the canonical additive character of , and let . Then we have
[TABLE]
[TABLE]
[TABLE]
Proposition 3.4**.**
[$$7, 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.11), (4.1), (3.4)-(3.6), one derives the following.
Proposition 3.6**.**
Let , , be as in (3.12). Then we have the following.
- (1)
[TABLE] 2. (2)
- (a)
For is even,
[TABLE] 2. (b)
For is odd,
[TABLE] 3. (3)
[TABLE]
Here .
Proof.
Here we only provide the proof for (2). The others can be shown in a similar manner. From (3.5), (3.7), (3.11) and (4.1), we have
[TABLE]
and hence
[TABLE]
Noting now that, for , is a square in if and only if is even, the results now follow from Remark 3.5. ∎
4. Construction of codes
Let
[TABLE]
Here we will construct three ternary linear codes of length , of length , and of length , respectively associated with the orthogonal groups , , and .
By abuse of notations, for , let be a fixed ordering of the elements in the group .
Also, for , we put
[TABLE]
Then, for , the ternary linear code is defined as
[TABLE]
where the dot denotes the usual inner product in .
The following Delsarte’s theorem is well-known.
Theorem 4.1**.**
* Let be a linear code over . Then*
[TABLE]
In view of this theorem, the dual is given by
[TABLE]
Lemma 4.2**.**
Let be as in (3.8) and (3.10), and let . Then we have
[TABLE]
Proof.
The LHS of (4.4) is equal to
[TABLE]
∎
Proposition 4.3**.**
The map is an -linear isomorphism, for every , and .
Proof.
As the proofs for and are similar, we will treat only the cases and . Let . The map is clearly -linear and surjective. Let be in the kernel of the map. Then, , for all . Assume that . Then
[TABLE]
So . This yields from Weil bound (1.1) that , equivalently . As , we must have . Now, let . Then again the map is -linear and surjective. Let be in the kernal of the map. Then , for all . Since , for all (cf. (3.16)), this in turn yields that . As the trace function is surjective, we must have . ∎
5. Recusive formulas for power moments of Kloosterman sums with 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 square arguments and even power moments of those with square arguments in terms of the frequencies of weights in , for each .
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.7).
Lemma 5.2**.**
Let , for , and . Then the Hamming weight can be expressed as follows:
- (1)
[TABLE] 2. (2)
[TABLE]
Proof.
For
[TABLE]
Our results now follow from (4.1) and (3.4)-(3.6). ∎
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.3), (1.4)) many such codewords with weight . Now, we get the following formulas in (5.4)-(5.7), by using the explicit values of in (3.13)-(3.16).
Theorem 5.3**.**
Let be the weight distribution of , for . Then we have the following.
[TABLE]
where the sum is over all the sets of nonnegative integers and satisfying
[TABLE]
and
[TABLE]
For even,
[TABLE]
*where the sum is over all the sets of nonnegative integers
and satisfying*
[TABLE]
and
[TABLE]
For odd,
[TABLE]
*where the sum is over all the sets of nonnegative integers
and satisfying*
[TABLE]
and
[TABLE]
[TABLE]
where the sum runs over all the sets of nonnegative integers and satisfying
[TABLE]
and, for every ,
[TABLE]
We now apply the Pless power moment identity in (5.1) to each , for , in order to obtain the results in Theorem 1.1 about recursive formulas. Then the left hand side of the identity in (5.1) is equal to
[TABLE]
with the in each case given by (5.2) and (5.3).
For , (5.8) is
[TABLE]
[TABLE]
Similarly, for , (5.8) equals
[TABLE]
Here one has to separate the term corresponding to in (5.9) and (5.10), and note .
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. 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 O − ( 2 n , q ) superscript 𝑂 2 𝑛 𝑞 O^{-}(2n,q) , Acta Arith. 80 (1997), 343–365.
- 5[5] D. S. Kim, Exponential sums for O − ( 2 n , q ) superscript 𝑂 2 𝑛 𝑞 O^{-}(2n,q) and their applications , Acta Arith. 97 (2001), 67–86.
- 6[6] D. S. Kim, Gauss sums for symplectic groups over a finite field , Mh.Math. 126 (1998), 55–71.
- 7[7] D. S. Kim, Exponential sums for symplectic groups and their apllications , Acta Arith. 88 (1999), 155–171.
- 8[8] D. S. Kim, Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups , Adv. Math. Commun. 3 (2009), 167–178.
