Papers
Topics
Authors
Recent
2000 character limit reached

Codes Associated with $O^+(2n,2^r)$ and Power Moments of Kloosterman Sums

Published 29 Jul 2008 in math.NT, cs.IT, and math.IT | (0807.4671v1)

Abstract: In this paper, we construct three binary linear codes $C(SO+(2,q))$, $C(O+(2,q))$, $C(SO+(4,q))$, respectively associated with the orthogonal groups $SO+(2,q)$, $O+(2,q)$, $SO+(4,q)$, with $q$ powers of two. Then we obtain recursive formulas for the power moments of Kloosterman and 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 Gauss sums for the orthogonal groups. We emphasize that, when the recursive formulas for the power moments of Kloosterman sums are compared, the present one is computationally more effective than the previous one constructed from the special linear group $SL(2,q)$. We illustrate our results with some examples.

Citations (15)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.