Professional Documents
Culture Documents
and
Tor Helleseth
An upper bound for the extended Kloosterman sum over Galois rings is derived.
This bound is then used to construct new sequence families with low correlation
properties and alphabet size a power of a prime. ( 1998 Academic Press
Key Words: Kloosterman sum; Galois ring; Witt ring; exponential sum; CDMA
sequences; periodic correlation.
I. INTRODUCTION
I.1. Overview
For a fixed prime p and integers e, m, e52, and m51, let R denote the
e,m
Galois Ring of characteristic pe and containing pem elements. Let
t : R PC be an additive character of R and let f (x) be a non-
e,m e,m e,m
degenerate polynomial (i.e., no monomial term in the polynomial has degree
* This work was supported in part by the National Science Foundation under Grant Number
NCR-93-05017 and The Norwegian Research Council under Grant Numbers 107542/410 and
107623/420.
- Current address: Qualcomm Inc., Q-302G, 6455 Lusk Boulevard, San Diego CA 92121.
218
1071-5797/98 $25.00
Copyright ( 1998 by Academic Press
All rights of reproduction in any form reserved.
EXTENDED KLOOSTERMAN SUMS 219
+ t ( f (x))
e,m
x| Te,m
K x| Te,m
e,m K
+ t ( f (x)) 4(D !1)Jpm
e,f
which was used in [4] to design new efficient four- and eight-phase sequence
families for CDMA applications.
In this paper we obtain an upper bound for the extended Kloosterman sums
over Galois rings, i.e., exponential sums of the form
k
primitive element in R . Let T "M0, 1, b , 2 , bp ~2N. It can be shown
l,k l,k l,k l,k
that every element z 3R has the p-adic expansion
l,k
z"z #pz #p2z #2#pl~1z , z 3T .
0 1 2 l~1 i l,k
Let s51 be an integer. Then R is an extension ring of R having Galois
l,ks l,k
group of order s generated by the automorphism q given by
k
k k k
q (x)"xp #pxp #2#pl~1x p ,
k 0 1 l~1
where x3 R has p-adic expansion
l,ks
x"x #px #2#pl~1x , x 3T .
0 1 l~1 i l,ks
We will abbreviate q ( ) ) to q( ) ). For x3 R , we define the trace
1 l,ks
¹ ( ) ) : R PR via
l,ks,k l,ks l,k
s~1
¹ (x)" + qi (x)
l,ks,k k
i/0
It is easily verified that
¹ (x)"¹ (¹ (x)).
l,ks,1 l,k,1 l,ks,k
D "maxMpe~1d , pe~2d , 2 , d N.
e,w 0 1 e~1
The principal result of the paper is
THEOREM 1. ¸et f (x), f (x) 3 R [x] be non-degenerate and have
1 2 e,m
weighted degree D and D respectively. Assume k ( f )O0, f I0. ¹hen
e,f1 e,f2 1 1 2
K x| T*e,m
2 K
+ t ( f (x)#f (x~1)) 4(D #D )Jpm.
e,m 1 e,f1 e,f2
When both D and D are less than Jpm!1, the size of the family F can
1 2 D1,D2
be shown to have the lower bound [9]
DF D1 @pye ~x
D5pm(D1`D2~x D2 @pye ~1). (2)
D1,D2
222 SHANBHAG, KUMAR, AND HELLESETH
TABLE 1
Four and Eight-Phase Sequence Designs
When the alphabet size is fixed, the sequence families listed in Table 1 offer
performance comparable to those constructed using weighted degree poly-
nomials [4]. In general, this will be true whenever
D #D #1 D D
1 2 "1# 1 # 2
pe pe pe
# : G PG
1,l 1,m l,m
where
A B
p~1
g (xp)"q~1 < gL (xmi) ,
j`1 j
i/0
where gL is any element of R [x] satisfying k (gL (x))"g (x), m is a primi-
j j`1,m j j j
tive pth root of unity in the algebraic closure of the field Q of p-adic numbers
p
and k is the degree of g (x). Each such lifting # can be shown to be
j j
multiplicative, from which it follows that # is multiplicative. The subsets
1,l
G -R [x] are recursively defined by
j,m j,m
G "# (G ), 24j4l.
j,m j~1 j~1,m
It turns out that the polynomials in G are monic for all j, 14j4l.
j,m
We note:
1. #~1"k .
j j
2. For a monic irreducible polynomial h (x) 3 F [x] of degree k with
1 m
factorization
k~1
h (x)" < (x!bvqi ), (4)
1 1,mk
i/0
where 04v4pmk!2 is an integer and b is a primitive element in F , we
1,mk mk
have
k~1
h (x)"# (h (x))" < (x!bvqi ), (5)
l 1,l 1 l,mk
i/0
where b is the primitive element in R satisfying k (b )"b .
l,mk l,mk 1 l,mk 1,mk
Let gL (x) 3R [x] satisfy k (gL (x))"g (x). We now present Lemma 1
j j`1,m j j j
in [4]:
224 SHANBHAG, KUMAR, AND HELLESETH
G
(!1)k(p~1)Mq~1(pL p )#pq~1[(!1)n(p~1)pL #G (pL , 2 , pL )]N
j,n j,pn 0 j,1 j,pn~1
if k5pn,
(!1)k(p~1)(q~1(pL p ))#q~1[G (pL , 2 , pL )] if k(pn,
j,n 1 j,1 j,k
where G ( ) ) and G ( ) ) are polynomials in several variables over Z j`1 .
0 1 p
II. AN ¸-FUNCTION
G
t ( + k ( f (e )#f (e~1 ))) if p 3 R*
j (g )" e,m i/1 1 i 2 i e,k e,m (6)
e,m e 0 otherwise.
f :
" + t ( f (x)#f (x~1)) (9)
e,ms e,ms 1 2
x| T*e,ms
EXTENDED KLOOSTERMAN SUMS 225
satisfy
De,f1`De,f2
f "¸ "! < gs . (10)
e,ms e,ms i
i/1
Proof. In the proof, we will abbreviate and write j( ) ) in place of j .
e,m
Since every polynomial g (x)3 G has a unique factorization as a product of
e e,m
monic, basic irreducibles in G , we can write
e,m
C D
1
" < ,
1!j(h)z$%'(h)
h| He,m
where H is the set of monic basic irreducibles in G . Note that
e,m e,m
H "# (H ) where H denotes the monic irreducibles in F [x].
e,m 1,e 1,m 1,m m
Then,
= d
+ ¸ zs"z log(¸ (z))
e,ms dz e,m
s/0
j(h) deg(h)
"z + z$%'(h)~1
[1!j(h)z$%'(h)]
h| He,m
" + deg(h)j(h)z$%'(h)[1#j(h)z$%'(h)#j2(h)z2$%'(h)#2].
h| He,m
Comparing coefficients of zs on both sides, we obtain that
r
h(x)" + (!1)ih xr~i, h "1.
i 0
i/0
Clearly each of the r zeros of h(x) lies in T* . Further, given any zero x of
e,mr 1
h(x), the remaining zeros x , 24i4r of h(x) satisfy
i
x "qi~1 (x ), 24i4r.
i m 1
226 SHANBHAG, KUMAR, AND HELLESETH
Thus,
j(h)"t (¹ ( f (x )#f (x~1))).
e,m e,mr,m 1 1 2 1
From this and using (11) it follows that
De,f1`De,f2
¸ (z)" < (1!g z)
e,m i
i/1
EXTENDED KLOOSTERMAN SUMS 227
A B
d De,f1`De,f2
z log < (1!g z)
dz i
i/1
and equating coefficients then gives (10). j
G
t ( + k (a( f (e )#f (e~1 )))) if p 3R*
j (g )" e,m i/1 1 i 2 i e,k e,m (12)
e,m,a e 0 otherwise.
De~la,f1`De~la,f2
¸ (z)" < (1!g z) (13)
e,m,a a,i
i/1
for some complex numbers g , where l "maxMiDpiDaN. Similarly, we have
a,i a
De~la,f1`De~la,f2
f "¸ "! < gs . (14)
e,ms,a e,ms,a a,i
i/1
Then
pe~1
peDZ D" + + t (a ) ( f (x)#f (x~1))). (16)
e,s e,ms 1 2
a/0 x| T*e,ms
Using the analogue of Hilbert’s Theorem 90 for Galois rings, we have
pe~1
) " + + t (a ) ( f (x)#f (x~1)))
e,s e,ms 1 2
a/0 x| T*e,ms
can be expressed in two ways as
pe~1 De~la,f1`De~la,f2
) "pms!1# + + !gs (17)
e,s a,i
a/1 i/1
"D Mx3 T* , y3R D q(y)!y"f (x)#f (x~1) (mod pe)ND (18)
e,ms e,ms 1 2
is the same as that of a system of e equations over F , that will turn out to
m
define a cyclic extension of the rational function field F (x) of degree pe.
m
Certainly, by equating coordinates in the p-adic expansion of both sides of
(19), one can obtain a system of e equations over F that define an extension
m
of the rational function field F (x). Direct attempts at proving the extension
m
to be cyclic of degree pe ran however, into difficulties, which were circum-
vented by using the isomorphism between Galois rings and Witt rings having
finite field components.
III.2.1. ¼itt Ring Definition. The material for this subsection is taken
mostly from Jacobson [3, pp. 124—140]. The notation does however, differ in
places.
EXTENDED KLOOSTERMAN SUMS 229
Let X"Q[Mz N ], where Q denotes the field of rational numbers and the
i i
Mz N are a finite set of indeterminates. Given a"(a , a , 2 , a )3 Xe, we
i i 0 1 e~1
define
ap"(a p , ap , 2 , ap )
0 1 e~1
l l~1
a(l)"a p #pa p #2#pla , 04l4e!1,
0 1 l
"(ap)(l~1)#pla , 04l4e!1,
l
/(a)"(a(0), a(1), 2 , a(e~1)),
c "b
0 0
1 l l~1
c " (b ![c p #pc p #2#pl~1c p ]), 14l4e!1.
l pl l 0 1 l~1
It can be verified that / and t are inverse maps. Let addition = and
multiplication x of elements a, b3Xe be defined as follows:
a = b"t(/(a)#/(b)),
a x b"t(/(a) ) /(b)).
(a = b)(l)"a(l)#b(l)
(a x b)(l)"a(l) ) b(l).
The theorem below is taken from Jacobson [3]. The proof is included, as
an intermediate step will prove useful in a subsequent subsection.
THEOREM 3. ¸et a, b 3 Xe and let
d "M (a , b ), 04l4e!1,
l l i j
where M are polynomials having integer coefficients.
l
EXTENDED KLOOSTERMAN SUMS 231
Next, let U be a commutative algebra over the finite field F . Let addition
m
and multiplication in Ue be defined by
a = b"c, a x b"d,
where
k k k
+ piz " + piu # + piv (mod pk`1).
i i i
i/0 i/0 i/0
Applying qk to both sides, gives
e,m
k k k k k k
+ piz p " + piu p # + piv p (mod pk`1).
i i i
i/0 i/0 i/0
232 SHANBHAG, KUMAR, AND HELLESETH
Therefore,
k k k~1 k~i i j
pkz p " + pi(u p ) p # + pi(v p ) p ! + piAip (u ip , v pj )
k i k~i i k~i
(mod pk`1).
k i i
i/0 i/0 i/0
(21)
The possibility of a connection between Witt rings and Galois rings was
pointed out to us by H. Stichtenoth. J. Lahtonen working independently, was
also aware of a connection between the two.
then
b "y p !y (mod p)
0 0 0
k`1 k 2 k~1
b "y p !y p #s (y , y p , y p , 2 , y p ) (mod p), 14k4e!1,
k k k k 0 1 2 k~1
where the s are polynomials with coefficients in F .
k 1
Let
f (x)"u (x)#pu (x)#2#pe~1u (x),
1 0 1 e~1
where u (x)"+ di u xj, u 3 T and similarly,
i j/0 i,j i,j e,ms
f (x~1)"v (x~1)#pv (x~1)#2#pe~1v (x~1),
2 0 1 e~1
where v (x~1)"+ di v x~j, v 3T .
i j/0 i,j i,j e,ms
Then
A B
e~1 di
!( f (x)#f (x~1))" + =pi + = (u xj, 0, 0, 2 , 0)
1 2 i,j
i/0 j/0
A B
e~1 di
= + =pi + = (v x~j, 0, 0, 2 , 0) ,
i,j
i/0 j/0
where = following the + denotes Witt ring addition. The Witt ring addi-
tion on the RHS can be carried out by treating u , v , x, x~1 as indeter-
i,j i,j
minates and pretending to work in the ring of Witt vectors over X"
Q[u , v , x, x~1]. In this situation,
i,j i,j
e~1 di e~1
/(!( f (x)#f (x~1)))" + pi + (u xj, u p xjp, 2 , u p xjp e~1 )
1 2 i,j i,j i,j
i/0 j/0
e~1 di e~1
# + pi + (v x~j, v p x~jp, 2 , v p x~jp e~1 )
i,j i,j i,j
i/0 j/0
"( f (x)#f (x~1), q( f (x)
1 2 1
#f (x~1)), 2 , qe~1( f (x)#f (x~1))),
2 1 2
where we have used ql( f ), ql( f ), 04l4e!1, to denote
1 2
e~1 e~1 di l
ql( f (x))" + piql(u (x))" + pi + u p xp l
1 i i,j
i/0 i/0 j/0
e~1 e~1 di l
ql( f (x~1))" + piql(v (x~j))" + pi + v p x~plj .
2 i i,j
i/0 i/0 j/0
234 SHANBHAG, KUMAR, AND HELLESETH
A B
p e~1
pms!1# + !+ gs "pms#1!+ hs!(n #n ), all s51,
a,i i 0 =
a/1 i i
where n "n "1 is the number of places in F above the place at zero
0 = e~1
and the place at infinity respectively in F , and Mh N are complex numbers
0 i
having magnitude Jq. It follows from Newton’s identities that the set Mh N
i
and the non-zero elements in the set Mg N are identical, thus establishing (23)
a,i
and Theorem 1 for the case k ( f (x))O0.
1 2
Case k ( f (x))"0. As before, let j be the largest integer such that
j1 2 1
f (x~1) is expressible in the form f (x~1)"pj1h(x~1), for some polynomial
2 2
h over R . Here we note that when pe~j1 Da, aO0,
e,ms
¸ " + t (a( f (x)#f (x~1)))
e,ms,a e,ms 1 2
x| T*e,ms
" + t (a f (x))
e,ms 1
x| T*e,ms
236 SHANBHAG, KUMAR, AND HELLESETH
"!1# + t (a f (x)).
e,ms 1
x| Te,ms
In this case, we know from the results of [4] that !+ T t (a f (x)) is
x| e,ms e,ms 1
a sum of sth powers of complex numbers each having magnitude Jq (or zero).
Thus, for pj1!1 choices of a, !¸ is a sum of sth powers of complex
e,ms,a
numbers Mg N from which precisely one has magnitude 1 and the remaining
a,i
have magnitude Jq (or zero). We then have,
p e~j 1Da i
a,i A
) "pms!1!(pj1!1)# + !+ gs # + !+ gs . (24)
e,s
p e~j1 P a i
B
a,i A B
a 0
O
then
d
qj1 (h(x~1))" + (c x~i)p j1
i
i/0
d
u" + M(c x~i)#(c x~i)p#2#(c x~i)p j1~1 N.
i i i
i/0
A B A B
pe~1
pms!1!(pj1!1)# + !+ gs # + !+ gs
e~j1 D
a,i e~j
a,i
pO a i a/1,p 1 P
a t
a 0
"pms#1!+ hs!(n #n ),
i 0 =
i
where we now have n "pj1 and n "1 and again Mh N are complex numbers
0 = i
having magnitude Jq. Again from Newton’s identities the set Mh N and the
i
non-zero elements in the set Mg N are identical, thus leading to Theorem 1
a,i
for this case.
ACKNOWLEDGMENT
The authors acknowledge H. Stichtenoth for several helpful suggestions which considerably
shortened our proof.
238 SHANBHAG, KUMAR, AND HELLESETH
REFERENCES