AN UPPER BOUND FOR WEIL EXPONENTIAL-SUMS OVER GALOIS RINGS AND APPLICATIONS

被引：99

作者：

KUMAR, PV

HELLESETH, T

CALDERBANK, AR

机构：

[1] UNIV BERGEN,DEPT INFORMAT,N-5020 BERGEN,NORWAY

[2] AT&T BELL LABS,MATH SCI RES CTR,MURRAY HILL,NJ 07974

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1995年 / 41卷 / 02期

基金：

美国国家科学基金会;

关键词：

EXPONENTIAL SUMS; GALOIS RINGS; WEIL BOUND; CARLITZ-UCHIYAMA BOUND; SEQUENCE DESIGN; POLYPHASE SEQUENCES;

D O I：

10.1109/18.370147

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present an analog of the well-known Weil-Carlitz-Uchiyama 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 p(e), p prime, e greater than or equal to 2. Some new constructions of eight-phase sequences are provided.

引用

页码：456 / 468

页数：13

共 27 条

[1] A NEW CLASS OF CYCLIC CODES [J].