Infinite families of recursive formulas generating power moments of Kloosterman sums: $O^-(2n,2^r)$ case

Rok, strany: 2013, 733 - 758

In this paper, we construct eight infinite families of binary linear codes associated with double cosets with respect to a certain maximal parabolic subgroup of the special orthogonal group $SO^-(2n,2^r)$, and we obtain four infinite families of recursive formulas for the power moments of Kloosterman sums and four 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)$.

ISO 690:

Kim, D. 2013. Infinite families of recursive formulas generating power moments of Kloosterman sums: $O^-(2n,2^r)$ case. In Mathematica Slovaca, vol. 63, no.4, pp. 733-758. 0139-9918. DOI: https://doi.org/10.2478/s12175-013-0132-3

APA:

Kim, D. (2013). Infinite families of recursive formulas generating power moments of Kloosterman sums: $O^-(2n,2^r)$ case. Mathematica Slovaca, 63(4), 733-758. 0139-9918. DOI: https://doi.org/10.2478/s12175-013-0132-3