z-logo
open-access-imgOpen Access
Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups
Author(s) -
Dae San Kim
Publication year - 2009
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2009.3.167
Subject(s) - mathematics , kloosterman sum , symplectic geometry , coset , moment map , moment (physics) , ternary operation , pure mathematics , exponential sum , gauss sum , exponential function , combinatorics , discrete mathematics , mathematical analysis , programming language , physics , classical mechanics , computer science
In this paper, we construct two infinite families of ternary linear codes associated with double cosets with respect to certain maximal parabolic subgroups of the symplectic group $S_p(2n, q)$. Here $q$ is a power of three. Then we obtain infinite families of recursive formulas for the power moments of Kloosterman sums with square arguments and for the even power moments of those in terms of the frequencies of weights in the codes. This is done via Pless power moment identities and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of ''Gauss sums'' for the symplectic groups $S_p(2n, q)$.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom