𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds of incomplete multiple Kloosterman sums

✍ Scribed by Igor E. Shparlinski

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
108 KB
Volume
126
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

We obtain an estimate for incomplete multiple Kloosterman sums modulo a prime which improves the previous result of W. Luo.

πŸ“œ SIMILAR VOLUMES

Bounds for Incomplete Hyper-Kloosterman
Bounds for Incomplete Hyper-Kloosterman Sums
✍ Wenzhi Luo πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 88 KB

A new upper bound is obtained for the incomplete hyper-Kloosterman sum by means of Burgess' estimate, provided the number of variables in the sum is sufficiently large. ## 1999 Academic Press In connection with the problem of expressing integers by a positive definite integral quadratic form in fo

Upper bounds on n-dimensional Kloosterma
Upper bounds on n-dimensional Kloosterman sums
✍ Todd Cochrane; Ming-Chit Liu; Zhiyong Zheng πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 252 KB

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 ΒΌ

The Lifting of Kloosterman Sums
The Lifting of Kloosterman Sums
✍ Y.B. Ye πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 407 KB

The purpose of this article is to prove several identities of Kloosterman sums based on the recent progress in the theory of relative trace formulas. (f) 1995 Academic Press. Inc.

An Upper Bound for the Extended Klooster
An Upper Bound for the Extended Kloosterman Sums over Galois Rings
✍ Abhijit G. Shanbhag; P. Vijay Kumar; Tor Helleseth πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 389 KB

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.

Lower bounds on multiple distinct sums s
Lower bounds on multiple distinct sums sets
✍ Wende Chen; Torleiv KlΓΈve πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 590 KB

Improved lower bounds on multiple distinct sums sets are given. Lower bounds for the more general case of multiple difference set of a distinct sum set are considered.