Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: Symplectic Case

Details Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: Symplectic Case Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: Symplectic Case

2009-07-23

arxiv.org/abs/0907.3970v1

Mathematics

Number Theory

21 pages

Scientific paper

In this paper, we construct two infinite families of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the symplectic group Sp(2n,q) Here q is a power of two. Then we obtain an infinite family of recursive formulas for the power moments of Kloosterman sums and those of 2-dimensional Kloosterman sums 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 exponential sums over those double cosets related to the evaluations of "Gauss sums" for the symplectic groups Sp(2n,q).

Affiliated with

Also associated with

No associations

Rating

Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: Symplectic Case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: Symplectic Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: Symplectic Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354456