The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd
Journal of Combinatorial Theory Series A
On binary Kloosterman sums divisible by 3
Designs, Codes and Cryptography
The weights of the orthogonals of the extended quadratic binary Goppa codes
IEEE Transactions on Information Theory
Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
IEEE Transactions on Information Theory
The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code
IEEE Transactions on Information Theory
Explicit evaluation of certain exponential sums of binary quadratic functions
Finite Fields and Their Applications
A transform property of Kloosterman sums
Discrete Applied Mathematics
Ternary Kloosterman sums modulo 18 using Stickelberger's theorem
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On divisibility of exponential sums of polynomials of special type over fields of characteristic 2
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums K(a) over a finite field F"2"^"m were evaluated modulo 24 in the case m odd, and the number of those a giving the same value for K(a) modulo 24 was given. In this paper the same is done in the case m even. The key techniques used in this paper are different from those used in the aforementioned work. In particular, we exploit recent results on the number of irreducible polynomials with prescribed coefficients.