On binary Kloosterman sums divisible by 3

DOI10.1007/s10623-008-9171-0zbMath1196.94084OpenAlexW2061678397MaRDI QIDQ1009054

Kseniya Garaschuk, Petr Lisoněk

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9171-0

Mathematics Subject Classification ID

Gauss and Kloosterman sums; generalizations (11L05) Cyclic codes (94B15)

Related Items

On classical Kloosterman sums ⋮ On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients ⋮ Some congruences of Kloosterman sums and their characteristic polynomials ⋮ Ternary Kloosterman sums modulo 4 ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Codes, graphs, and schemes from nonlinear functions
• On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
• Binary caps with many free pairs of points
• The weights of the orthogonals of the extended quadratic binary Goppa codes
• Families of curves and weight distributions of codes

This page was built for publication: On binary Kloosterman sums divisible by 3