An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case
From MaRDI portal
Publication:2855610
zbMath1296.11099arXiv0909.0809MaRDI QIDQ2855610
Publication date: 25 October 2013
Full work available at URL: https://arxiv.org/abs/0909.0809
symplectic grouporthogonal grouplinear codeKloosterman sumrecursive formulaparabolic subgroupPless identity
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Gauss and Kloosterman sums; generalizations (11L05)
This page was built for publication: An Infinite Family of Recursive Formulas Generating Power Moments of Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case