The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code
From MaRDI portal
Publication:3548242
DOI10.1109/TIT.2006.889020zbMath1177.11071MaRDI QIDQ3548242
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2006.889020
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
11L05: Gauss and Kloosterman sums; generalizations
94B15: Cyclic codes
Related Items
CONSTRUCTION OF RECURSIVE FORMULAS GENERATING POWER MOMENTS OF KLOOSTERMAN SUMS: O + (2n, 2 r ) CASE, Infinite families of recursive formulas generating power moments of Kloosterman sums: O −(2n,2r) case, Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\), Codes associated with special linear groups and power moments of multi-dimensional Kloosterman sums, Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed, The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) even, On the moments of Kloosterman sums and fibre products of Kloosterman curves, Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros, On classical Kloosterman sums, Functional equations of $L$-functions for symmetric products of the Kloosterman sheaf, CODES ASSOCIATED WITH Sp(4,q) AND EVEN-POWER MOMENTS OF KLOOSTERMAN SUMS