Skip to main content

An upper bound for some exponential sums over Galois rings and applications

Publication ,  Journal Article
Vijay Kumar, PV; Helleseth, T; Calderbank, AR
Published in: IEEE International Symposium on Information Theory - Proceedings
January 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. © 1994 IEEE.

Duke Scholars

Published In

IEEE International Symposium on Information Theory - Proceedings

DOI

ISSN

2157-8095

Publication Date

January 1, 1994

Start / End Page

70
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Vijay Kumar, P. V., Helleseth, T., & Calderbank, A. R. (1994). An upper bound for some exponential sums over Galois rings and applications. IEEE International Symposium on Information Theory - Proceedings, 70. https://doi.org/10.1109/ISIT.1994.394900
Vijay Kumar, P. V., T. Helleseth, and A. R. Calderbank. “An upper bound for some exponential sums over Galois rings and applications.” IEEE International Symposium on Information Theory - Proceedings, January 1, 1994, 70. https://doi.org/10.1109/ISIT.1994.394900.
Vijay Kumar PV, Helleseth T, Calderbank AR. An upper bound for some exponential sums over Galois rings and applications. IEEE International Symposium on Information Theory - Proceedings. 1994 Jan 1;70.
Vijay Kumar, P. V., et al. “An upper bound for some exponential sums over Galois rings and applications.” IEEE International Symposium on Information Theory - Proceedings, Jan. 1994, p. 70. Scopus, doi:10.1109/ISIT.1994.394900.
Vijay Kumar PV, Helleseth T, Calderbank AR. An upper bound for some exponential sums over Galois rings and applications. IEEE International Symposium on Information Theory - Proceedings. 1994 Jan 1;70.

Published In

IEEE International Symposium on Information Theory - Proceedings

DOI

ISSN

2157-8095

Publication Date

January 1, 1994

Start / End Page

70