Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups
DOI10.3934/AMC.2009.3.167zbMATH Open1231.11138OpenAlexW1989705532MaRDI QIDQ2268248FDOQ2268248
Authors: Dae San Kim 
Publication date: 10 March 2010
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2009.3.167
Recommendations
- Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments associated with \(O^{-}(2n,q)\)
- Ternary codes associated with symplectic groups and power moments of Kloosterman sums with square arguments
- Codes constructed from symplectic groups and recursive formulas generating power moments of Kloosterman sums
- Ternary codes associated with \(\mathrm{O}(3,3^r)\) and power moments of Kloosterman sums with trace nonzero square arguments
- An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case
Gauss sumweight distributionKloosterman sumpower momentsymplectic grouppless power moment identitysquare argumentternary linear code
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Gauss and Kloosterman sums; generalizations (11L05) Other character sums and Gauss sums (11T24) Linear algebraic groups over finite fields (20G40)
Cited In (8)
- Ternary codes associated with \(O^{-}(2n,q)\) and power moments of Kloosterman sums with square arguments
- 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 Kloosterman sums: O −(2n,2r) case
- Symmetric power \(L\)-functions for families of generalized Kloosterman sums
- Construction of recursive formulas generating power moments of Kloosterman sums: \(O^+(2n,2^r)\) case
- Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments associated with \(O^{-}(2n,q)\)
- Codes constructed from symplectic groups and recursive formulas generating power moments of Kloosterman sums
- Ternary codes associated with symplectic groups and power moments of Kloosterman sums with square arguments
This page was built for publication: Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268248)
