Construction of recursive formulas generating power moments of Kloosterman sums: $O^{+}(2n,2^{r})$ case
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we construct four infinite families of binary linear codes associated with double cosets with respect to a certain maximal parabolic subgroup of the orthogonal group $O^{+}(2n,2^{r})$. And we obtain two infinite families of recursive formulas for the power moments of Kloosterman sums and those of 2-dimensional Kloosterman sums in terms of the frequencies of weights in the codes. This is done via Pless' power moment identity and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of ``Gauss sums" for the orthogonal groups $O^{+}(2n,2^{r})$.
Abstract
In this paper, we construct four infinite families of binary linear codes associated with double cosets with respect to a certain maximal parabolic subgroup of the orthogonal group $O^{+}(2n,2^{r})$. And we obtain two infinite families of recursive formulas for the power moments of Kloosterman sums and those of 2-dimensional Kloosterman sums in terms of the frequencies of weights in the codes. This is done via Pless' power moment identity and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of ``Gauss sums" for the orthogonal groups $O^{+}(2n,2^{r})$.
참고문헌 (21)
- L. Carlitz, "Gauss sums over nite elds of order 2n", Acta Arithmetica, 15(3), pp.247~265 (1968), Institute of Mathematics, Polish Academy of Sciences[DOI]
- L. Carlitz, "A note on exponential sums", Pacic J. Math, 30, pp.35~37 (1969)
- P. Charpin, "Propagation characteristics of x ↦x-1 and Kloosterman sums", Finite Fields Appl, 13(2), pp.366~381 (2007)[DOI]
- J.-M. Deshouillers, "Kloosterman sums and Fourier coecients of cusp forms", Invent. Math, 70(2), pp.219~288 (1982)[DOI]
- H. Dobbertin, "Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums", IEEE Trans. Inform. Theory, 52(2), pp.613~627 (2006)[DOI]
- R. Evans, "Seventh power moments of Kloosterman sums", Israel J. Math, 175, pp.349~362 (2010)[DOI]
- K. Hulek, "The modularity of the Barth-Nieto quintic and its relatives", Adv. Geom, 1(3), pp.263~289 (2001)[DOI]
- D. S. Kim, "Gauss sums for symplectic groups over a nite eld", Monatsh. Math, 126(1), pp.55~71 (1998)[DOI]
- D. S. Kim, "Innite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups", Adv. Math. Commun, 3(2), pp.167~178 (2009)[DOI]
- D. S. Kim, "Codes associated with special linear groups and power moments of multidimensional Kloosterman sums", Ann. Mat. Pura Appl., 190(1), pp.61~76 (2011)[DOI]
- D. S. Kim, "Codes associated with O+(2n; 2r) and power moments of Kloosterman sums", Integers, 12(2), pp.237~257 (2012)[DOI]
- D. S. Kim, "Gauss sums for orthogonal groups over a nite eld of characteristic two", Acta Arith, 82(4), pp.331~357 (1997)[DOI]
- H. D. Kloosterman, "On the representation of numbers in the form ax2+by2+cz2+dt2", Acta Math, 49(3-4), pp.407~464 (1927)[DOI]
- G. Lachaud, "The weights of the orthogonals of the extended quadratic binary Goppa codes", IEEE Trans. Inform. Theory, 36(3), pp.686~692 (1990)[DOI]
- R. Lidl, "Encyclopedia of Mathematics and its Applications, 20" (1997), Cambridge University Press
- R. Livne, "Motivic orthogonal two-dimensional representations of Gal(Q=Q)", Israel J. Math, 92(1-3), pp.149~156 (1995)[DOI]
- F. J. MacWilliams, "The Theory of Error-Correcting Codes. II" (1977), North-Holland Publishing Co
- M. J. Moisio, "The moments of a Kloosterman sum and the weight distribution of a Zetterberg-type binary cyclic code", IEEE Trans. Inform. Theory, 53(2), pp.843~847 (2007)[DOI]
- C. Peters, "The Hasse zeta function of a K3 surface related to the number of words of weight 5 in the Melas codes", J. Reine Angew. Math, 432, pp.151~176 (1992)
- H. Salie, "Uber die Kloostermanschen Summen S(u, v; q)", Math. Z., 34, pp.91~109 (1931)
- R. Schoof, "Hecke operators and the weight distributions of certain codes", J. Combin. Theory Ser. A, 57(2), pp.163~186 (1991)[DOI]