Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Recursive formulas generating power moments of multi-dimensional Kloosterman sums and $m$-multiple power moments of Kloosterman sums (0909.1153v1)

Published 7 Sep 2009 in math.NT, cs.IT, and math.IT

Abstract: In this paper, we construct two binary linear codes associated with multi-dimensional and $m -$multiple power Kloosterman sums (for any fixed $m$) over the finite field $\mathbb{F}_{q}$. Here $q$ is a power of two. The former codes are dual to a subcode of the binary hyper-Kloosterman code. Then we obtain two recursive formulas for the power moments of multi-dimensional Kloosterman sums and for the $m$-multiple power moments of Kloosterman sums in terms of the frequencies of weights in the respective codes. This is done via Pless power moment identity and yields, in the case of power moments of multi-dimensional Kloosterman sums, much simpler recursive formulas than those associated with finite special linear groups obtained previously.

Citations (2)

Summary

We haven't generated a summary for this paper yet.