An upper bound for extended Kloosterman sums over Galois rings
A.G. Shanbhag, P. Vijay Kumar, Tor Helleseth · 2002
An upper bound for the extended Kloosterman sum over Galois rings is derived. This bound is then used to construct new, efficient sequence families with prime-power phase. These sums lead to new sequence designs for CDMA applications.