Upper bound for some exponential sums over Galois rings and applications
Publication
, Journal Article
Kumar, PV; Helleseth, T; Calderbank, AR
Published in: IEEE International Symposium on Information Theory Proceedings
December 1, 1994
An upper bound for Weil-type exponential sums over Galois rings is presented together with some examples where the bound is tight. The bound may be regarded as the Galois-ring analogue of the well-known Weil-Carlitz-Uchiyama bound for exponential sums over finite fields. An application of the bound to the design of large families of eight-phase sequences having low correlation is also given.
Duke Scholars
Published In
IEEE International Symposium on Information Theory Proceedings
Publication Date
December 1, 1994
Citation
APA
Chicago
ICMJE
MLA
NLM
Kumar, P. V., Helleseth, T., & Calderbank, A. R. (1994). Upper bound for some exponential sums over Galois rings and applications. IEEE International Symposium on Information Theory Proceedings.
Kumar, P. V., T. Helleseth, and A. R. Calderbank. “Upper bound for some exponential sums over Galois rings and applications.” IEEE International Symposium on Information Theory Proceedings, December 1, 1994.
Kumar PV, Helleseth T, Calderbank AR. Upper bound for some exponential sums over Galois rings and applications. IEEE International Symposium on Information Theory Proceedings. 1994 Dec 1;
Kumar, P. V., et al. “Upper bound for some exponential sums over Galois rings and applications.” IEEE International Symposium on Information Theory Proceedings, Dec. 1994.
Kumar PV, Helleseth T, Calderbank AR. Upper bound for some exponential sums over Galois rings and applications. IEEE International Symposium on Information Theory Proceedings. 1994 Dec 1;
Published In
IEEE International Symposium on Information Theory Proceedings
Publication Date
December 1, 1994