Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups
From MaRDI portal
Publication:2268248
DOI10.3934/amc.2009.3.167zbMath1231.11138OpenAlexW1989705532MaRDI QIDQ2268248
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
Gauss sumsymplectic groupweight distributionKloosterman sumpower momentpless power moment identitysquare argumentternary linear code
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear algebraic groups over finite fields (20G40) Linear codes (general theory) (94B05) Gauss and Kloosterman sums; generalizations (11L05) Other character sums and Gauss sums (11T24)
Related Items
Ternary codes associated with \(O^{-}(2n,q)\) and power moments of Kloosterman sums with square arguments, Infinite families of recursive formulas generating power moments of Kloosterman sums: O −(2n,2r) case, CONSTRUCTION OF RECURSIVE FORMULAS GENERATING POWER MOMENTS OF KLOOSTERMAN SUMS: O + (2n, 2 r ) CASE