The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd

DOI10.1016/j.jcta.2006.06.002zbMath1112.11055OpenAlexW1982728886MaRDI 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

zbMATH Keywords

exponential sumsBCH codescosetsKloosterman sumsdivisibilityMelas codeirreducible code

Mathematics Subject Classification ID

Exponential sums (11T23) Combinatorial codes (94B25)

Related Items

On classical Kloosterman sums, A note on the moments of Kloosterman sums, Further results on semi-bent functions in polynomial form, On divisibility of exponential sums of polynomials of special type over fields of characteristic 2, A new construction of differentially 4-uniform \((n,n-1)\)-functions, Some congruences of Kloosterman sums and their characteristic polynomials, Further investigations on permutation based constructions of bent functions, 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, Ternary Kloosterman sums modulo 4, On the Link of Some Semi-bent Functions with Kloosterman Sums, Construction of semi-bent functions with high algebraic degrees, On Kloosterman sums over finite fields of characteristic 3, A class of hyper-bent functions and Kloosterman sums, On ternary Kloosterman sums modulo 12, A transform property of Kloosterman sums, Complete weight enumerators of two classes of linear codes with a few weights, 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, An efficient deterministic test for Kloosterman sum zeros, A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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)