Title :
An upper bound for Weil exponential sums over Galois rings and applications
Author :
Kumar, P.V. ; Helleseth, Tor ; Calderbank, A.R.
Author_Institution :
Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
fDate :
3/1/1995 12:00:00 AM
Abstract :
We present an analog of the well-known Weil-Carlitz-Uchiyama (1948, 1957) upper bound for exponential sums over finite fields for exponential sums over Galois rings. Some examples are given where the bound is tight. The bound has immediate application to the design of large families of phase-shift-keying sequences having low correlation and an alphabet of size pe. p, prime, e⩾2. Some new constructions of eight-phase sequences are provided
Keywords :
Galois fields; correlation theory; encoding; phase shift keying; sequences; Galois rings; Weil bound; Weil exponential sums; alphabet size; coding; eight-phase sequences; exponential sums; low correlation; phase-shift-keying sequences; upper bound; Additives; Codes; Communication systems; Councils; Galois fields; Informatics; Information theory; Phase shift keying; Polynomials; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
