The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
From MaRDI portal
Publication:868885
DOI10.1016/j.jcta.2006.06.002zbMath1112.11055MaRDI QIDQ868885
Tor Helleseth, Pascale Charpin, Victor A. Zinoviev
Publication date: 26 February 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2006.06.002
Related Items
Ternary Kloosterman sums modulo 4, A transform property of Kloosterman sums, A note on the moments of Kloosterman sums, On ternary Kloosterman sums modulo 12, On binary Kloosterman sums divisible by 3, The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) even, Divisibility properties of classical binary Kloosterman sums, On divisibility of exponential sums of polynomials of special type over fields of characteristic 2, Some congruences of Kloosterman sums and their characteristic polynomials, A new class of bent and hyper-bent Boolean functions in polynomial forms, On cosets of weight 4 of binary BCH codes with minimum distance 8 and exponential sums, An efficient deterministic test for Kloosterman sum zeros, On the Link of Some Semi-bent Functions with Kloosterman Sums, Construction of semi-bent functions with high algebraic degrees
Cites Work
- On cosets of weight 4 of binary BCH codes with minimum distance 8 and exponential sums
- On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- The coset distribution of triple-error-correcting binary primitive BCH codes
- A duality theorem for the weight distribution of some cyclic codes
- Explicit evaluation of certain exponential sums.
- On cryptographic properties of the cosets of R(1, m)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item