Infinite families of recursive formulas generating power moments of Kloosterman sums: O −(2n,2r) case
From MaRDI portal
Abstract: In this paper, we construct four infinite families of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the orthogonal group O^+(2n,2^r). Here q is a power of two. Then we obtain two infinite families 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 orthogonal groups O^+(2n,2^r).
Recommendations
- An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case
- Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments associated with \(O^{-}(2n,q)\)
- Construction of recursive formulas generating power moments of Kloosterman sums: O^+(2n,2r) case
- Recursive formulas generating power moments of multi-dimensional Kloosterman sums and m-multiple power moments of Kloosterman sums
- Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups
- Simple recursive formulas generating power moments of Kloosterman sums
- A recursive formula for power moments of 2-dimensional Kloosterman sums associated with general linear groups
- A generalization of power moments of Kloosterman sums
- Power moments of Kloosterman sums
- Symmetric power L-functions for families of generalized Kloosterman sums
Cites work
- Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- Seventh power moments of Kloosterman sums
- The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code
- The weights of the orthogonals of the extended quadratic binary Goppa codes
Cited in
(5)- An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case
- Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments associated with \(O^{-}(2n,q)\)
- Recursive formulas generating power moments of multi-dimensional Kloosterman sums and m-multiple power moments of Kloosterman sums
- Construction of recursive formulas generating power moments of Kloosterman sums: O^+(2n,2r) case
- Codes constructed from symplectic groups and recursive formulas generating power moments of Kloosterman sums
This page was built for publication: Infinite families of recursive formulas generating power moments of Kloosterman sums: O −(2n,2r) case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746283)
