On ternary Kloosterman sums modulo 12

DOI10.1016/j.ffa.2008.07.002zbMath1179.11046OpenAlexW2028343756MaRDI QIDQ958621

Petr Lisoněk, Kseniya Garaschuk

Publication date: 5 December 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2008.07.002

zbMATH Keywords

elliptic curveKloosterman sumquasi-perfect linear code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Curves over finite and local fields (11G20) Gauss and Kloosterman sums; generalizations (11L05) Other character sums and Gauss sums (11T24)

Related Items (7)

On the 2-ranks of a class of unitals ⋮ On classical Kloosterman sums ⋮ Some congruences of Kloosterman sums and their characteristic polynomials ⋮ A family of constacyclic ternary quasi-perfect codes with covering radius 3 ⋮ Ternary Kloosterman sums modulo 4 ⋮ On theorems of Carlitz and Payne on permutation polynomials over finite fields with an application to \(x^{-1}+L(x)\) ⋮ On the Connection between Kloosterman Sums and Elliptic Curves

Cites Work

• Unnamed Item
• The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
• Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums
• A family of ternary quasi-perfect BCH codes
• Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros
• Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm

This page was built for publication: On ternary Kloosterman sums modulo 12