pith. sign in

arxiv: 0909.1175 · v1 · submitted 2009-09-07 · 🧮 math.NT · cs.IT· math.IT

Infinite Families of Recursive Formulas Generating Power Moments of Ternary Kloosterman Sums with Trace Nonzero Square Arguments: O(2n+1,2^(r)) Case

classification 🧮 math.NT cs.ITmath.IT
keywords powercosetsdoublefamiliessumsassociatedcodesgenerating
0
0 comments X
read the original abstract

In this paper, we construct four infinite families of ternary linear codes associated with double cosets in $O(2n+1,q)$ with respect to certain maximal parabolic subgroup of the special orthogonal group $SO(2n+1,q)$. Here $q$ is a power of three. Then we obtain two infinite families of recursive formulas, the one generating the power moments of Kloosterman sums with $``$trace nonzero square arguments" and the other generating the even power moments of those. Both of these families are expressed in terms of the frequencies of weights in the codes associated with those double cosets in $O(2n+1,q)$ and in the codes associated with similar double cosets in the symplectic group $Sp(2n,q)$. This is done via Pless power moment identity and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of $"$Gauss sums" for the orthogonal group $O(2n+1,q)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.