An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case

Details An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case

2009-09-04

arxiv.org/abs/0909.0809v1

Mathematics

Number Theory

14 pages

Scientific paper

In this paper, we construct an infinite family of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the orthogonal group O(2n+1,q). Here q is a power of two. Then we obtain an infinite family of recursive formulas generating the odd power moments of Kloosterman sums with trace one arguments 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).

Affiliated with

Also associated with

No associations

Rating

An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) 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 An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35518