Upper bounds on n-dimensional Kloosterman sums
β Scribed by Todd Cochrane; Ming-Chit Liu; Zhiyong Zheng
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 252 KB
- Volume
- 106
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let p m be any prime power and K n Γ°a; p m Γ be the Kloosterman sum
where the x i are restricted to values not divisible by p: Let m; n be positive integers with mX2 and suppose that p g jjΓ°n ΓΎ 1Γ: We obtain the upper bound jK n Γ°a; p m ΓjpΓ°n ΓΎ 1; p Γ 1Γp 1=2 minΓ°g;mΓ2Γ p mn=2 ; for odd p: For p ΒΌ 2 we obtain the same bound, with an extra factor of 2 inserted.
π SIMILAR VOLUMES
An upper bound for the extended Kloosterman sum over Galois rings is derived. This bound is then used to construct new sequence families with low correlation properties and alphabet size a power of a prime.
An upper bound estimate of high-dimensional Cochrane sums is given in this note using Weinstein's version of Deligne's estimate for the hyper-Kloosterman sum and a mean value theorem of Dirichlet L-functions.
Consider a 2-dimensional consecutive-k-out-of-n : F system, as described by Salvia and Lasher [9], whose components have independent, perhaps identical, failure probabilities. In this paper, we use Janson's exponential inequalities to derive improved upper bounds on such a system's reliability, and