This article has been accepted for publication in a future issue of this journal, but has not been

fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2700845, IEEE
Communications Letters
IEEE COMMUNICATIONS LETTERS, VOL. , NO. , 1

Constructions of Binary Sequence Pairs of Period

3p with Optimal Three-Level Correlation
Xiumin Shen, Yanguo Jia and Xiaofei Song

AbstractIn this letter, we present a new generalized cy- TABLE I

clotomic method over Z3p based on Chinese Remainder The- C OMPARISON OF K NOWN B INARY S EQUENCE PAIR WITH L OW
orem and cyclotomic classes of order 2. Two new families of O UT- OF - PHASE C ORRELATION VALUE
binary sequence pairs of period N = 3p with optimal three-
Out-of-phase
level correlation values are constructed by utilizing these new Period N
Correlation
Reference
generalized cyclotomic classes, where p > 3 is an odd prime. All
N = p, p 1 (mod 4) {-1} [4]
the constructed binary sequence pairs have optimal correlation
N = np, gcd(n, p) = 1 {-1} [5]
values {3, 1} or {1, 3}.
N = 4p {0,-4} [5]
Index Termssequence pairs, optimal correlation, cyclotomy, N 1 (mod 2) {-3,1} [6]
Chinese Remainder Theorem. N = 3p,p > 3 {-3,1} this letter
N = 3p,p > 3 {-1,3} this letter

I. I NTRODUCTION
I T is well known that sequences with optimal autocor-
relation have significant applications in communication
systems, Code Division Multiple Access(CDMA), radar, signal
processing and source coding. Such sequences are required
to have out-of-phase correlation value as small as possible.
However, the correlation of traditional sequences, which is
defined as the inner product of the sequence and its time
delayed shift, restricts the spectrum of feasible lengths of such
sequences. To overcome this obstacle, Zhao et al. [1] proposed
a new class of discrete signal sequence pair, which can be con-
sidered as a special class of mismatched filtering sequences.
In mismatched filtering system, distinct sequences are used
at the transmitting and receiving ends of the communication.
In the past decades, lots of efforts have been devoted to the
investigation of sequence pairs (see [2] and the references
therein).
Let (x, y) be a binary sequence pair of period N , the three-
level periodic cross-correlation function of (x, y) is defined
as
N
X 1 v =0
R(x,y) ( ) = x(t)y(t + ) = 1 T (1)
2 ZN T first constructed in [6] based on difference sets and difference
t=0
where v 6= 1 6= 2 , x = {x(t) : 0 t N 1}, y = {y(t) :
0 t N 1}, x(t), y(t) {1, 1}, t + takes modulo N ,
ZN = ZN \ {0} and T is a subset of ZN .
(x, y) is considered to be a perfect binary sequence pair if
1 = 2 = 0[1] . It was conjectured that there exists only
one class of perfect binary sequence pair with period N
0 (mod 4)[3]. When N is odd and 1 = 2 = 1 , (x, y)
is called an ideal two-level correlation binary sequence pair.
Binary sequence pairs with correlation values -1 were first
The authors are with the School of Information Science and En-
gineering, Yanshan University, Qinhuangdao 066004, China (e-mail:
cscxcm@foxmail.com; jyg@ysu.edu.cn; xiaofeis@ysu.edu.cn).
constructed in [4] based on cyclotomic classes of order 2,
4, and 6, however, the sequence x and sequence y of each
sequence pair were different only at x(0) and y(0). Later,
Peng in [5] constructed many kinds of binary sequence pairs
of period N = np with ideal two-level correlation based on
cyclotomy and interleaving technique.
From [5], it was concluded that the smallest value of
|1 2 | is 4. Since binary sequence pair with even period
has even out-of-phase correlation values and the binary se-
quence pair with odd period has odd out-of-phase correlation
values[11], the smallest two out-of-phase correlation values
of binary sequence pairs with three-level correlation are as
follows.
1) {2, 2}, {0, 4} or {0, 4} if N 0 (mod 2).
2) {3, 1} or {1, 3} if N 1 (mod 2).
(x, y) is called a binary sequence pair with optimal three-
level correlation if 1 and 2 take the smallest values listed
above. In [5], the authors presented two new constructions of
binary sequence pairs of period N 0 ( mod 4) with optimal
correlation {0, 4} by utilizing cyclotomic classes of order 4.
Binary sequence pairs with optimal correlation {3, 1} were
set pairs.
In this letter, we present a new generalized cyclotomic
method over Z3p based on Chinese Remainder Theorem and
cyclotomic classes of order 2. Then two new families of binary
sequence pairs of period N = 3p are constructed by utilizing
these new generalized cyclotomic classes. All the constructed
binary sequence pairs have optimal correlation values {3, 1}
or {1, 3}, which can greatly extend the number of optimal
three-level binary sequence pairs.
This letter is organized as follows. Section II gives the
notations and the related lemmas needed for the remainder of
this letter. The new generalized cyclotomic method over Z3p
is introduced in this section. The main results are provided
in Section III, where we will construct two families of binary

1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2700845, IEEE
Communications Letters
IEEE COMMUNICATIONS LETTERS, VOL. , NO. , 2

sequence pairs with optimal three-level correlation. Finally, Example 1: Let p = 5, = 2, Then
Section IV makes a concluding statement for this letter.
H0 = {1, 4}, H1 = {2, 3}, H2 = {0},
II. P RELIMINARIES
F0,0 = f 1 ({0} H0 ) = {f 1 (0, 1), f 1 (0, 4)} = {6, 9},
Cyclotomy is a powerful mathematics tool for constructing
F0,1 = f 1 ({0} H1 ) = {f 1 (0, 2), f 1 (0, 3)} = {12, 3},
sequences and sequence pairs. Ding et al. [7] gave several
new families of binary sequences of period N = 2p with op- F0,2 = f 1 ({0} H2 ) = {f 1 (0, 0)} = {0}.
timal three-level autocorrelation based on Chinese Remainder
Theorem and cyclotomic classes of order 4. In a similar way, Similarly, we can get
we will present new generalized cyclotomic classes over Z3p
based on cyclotomic classes of order 2 in this section. F1,0 = {1, 4}, F1,1 = {7, 13}, F1,2 = {10},
According to the definition of cyclotomic classes in [8], let
p = 2f +1 be an odd prime, where f is a positive integer, be F2,0 = {11, 14}, F2,1 = {2, 8}, F2,2 = {5}.
2 [2
a primitive root modulo p, and Hh = {h+2t , t = 0, 1, . . . , f [
1} , h = 0, 1, then these Hh are called cyclotomic classes of Z15 = Fk,i = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
k=0 i=0
order 2. Especially, let H2 = {0}, then the finite ring Zp =
S 2 14}.
i=0 Hi .
The cyclotomic numbers of order 2 are defined as (i, j) =
|(Hi + 1) Hj |, i, j = 0, 1, which are given in the following Let D, D0 be subsets of the ring Z3p , and (x, y) be a binary
lemma. sequence pair with period N = 3p, (D, D0 ) is called the
Lemma 1: ([8]) If p 1 (mod 4) then characteristic set pair of (x, y) if
(0, 0) = (p 5)/4, (0, 1) = (1, 0) = (1, 1) = (p 1)/4.  
1, if t D, 1, if t D0 ,
If p 3 (mod 4) then x(t) = y(t) = (2)
1, if t D. 1, if t D0 .
(0, 1) = (p + 1)/4, (0, 0) = (1, 0) = (1, 1) = (p 3)/4.
Correspondingly, (x, y) is called the characteristic sequence
Lemma 2: ([8]) The elementary facts about cyclotomic pair of (D, D0 ).
numbers are as follows.
The difference function dD,D0 ( ) can be defined as
(i)(i0 , j 0 ) = (i, j), where i0 i (mod 2), j 0 j (mod 2).
(ii)(i, j) = (2 i, j i). dD,D0 ( ) = |D0 (D + )|. (3)
Lemma 3: ([9]) If g Hh , h = 0, 1, then
Where D + = {g + : g D} and g + takes modulo 3p.
(i)|Hj (Hi + g)| = (i h, j h).
 Lemma 4: ([6]) Let (D, D0 ) be the characteristic set pair of
1, if j = h, (x, y), |D| = m, |D0 | = m0 , then
(ii)|Hj {g}| =
0, otherwise.
(iii)|{0} (Hj + g)| =
R(x,y) ( ) = N 2(m + m0 ) + 4dD,D0 ( ). (4)
1, if j = h and p 1 (mod 4)
or j 6= h and p 3 (mod 4),

0, otherwise. So, the value of R(x,y) ( ) can be obtained as long as the
difference function dD,D0 ( ) is found.
By the Chinese Remainder Theorem, Z3p = Z3 Zp under
the isomorphism f ( ) = (1 , 2 ) , where 1 = mod 3 ,
2 = mod p, see[10].
Define Fk,i = f 1 ({k} Hi ), k, i = 0, 1, 2, then |Fk1 ,i1 III. C ONSTRUCTIONS OF B INARY S EQUENCE PAIRS WITH
Fk2 ,i2 | = 0 if k1 6= k2 or i1 6= i2 .We have O PTIMAL T HREE -L EVEL C ORRELATION
S2 S2
Z3p = k=0 i=0 Fk,i .
In this section, two families of binary sequence pairs with
It is then clear that optimal three-level correlation are constructed by utilizing the
F0,2 = f 1 (0, 0) = 0. new generalized cyclotomic classes presented in section II. In
 the remainder of this letter, k, l Z3 = {0, 1, 2}, h Z2 =
p, if p 1 (mod 3),
F1,2 = f 1 (1, 0) = {0, 1}, k + 1 and k + 2 take modulo 3, and h + 1 takes modulo
2p, if p 2 (mod 3).
 2.
1 2p, if p 1 (mod 3), Theorem 1: For p 3 ( mod 4), the characteristic sequence
F2,2 = f (2, 0) =
p, if p 2 (mod 3). pair (x, y) of (D, D0 ), defined by (2), has optimal three-level

1, if i = 2, correlation if D and D0 are defined as shown in Table II.
|Fk,i | =
(p 1)/2, if i = 0, 1. Where v, 1 and 2 are defined in (1).

1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2700845, IEEE
Communications Letters
IEEE COMMUNICATIONS LETTERS, VOL. , NO. , 3

TABLE II |{k} {k + 3}| = |{k + 1} {k + 4}| = 1, the equation (5)

D EFINITING S ETS OF (D, D 0 ) A ND T HE C ORRESPONDING T HREE reduces to
C ORRELATION VALUES OF (x, y) FOR p 3 (mod 4)
dD,D0 ( ) = 2|Hh (Hh + 2 )|.
D D0 v 1 2

1
Fk,h Fk+1,h
Fk,h Fk+1,h 2p + 1 -1 3
by Lemma 2 and Lemma 3, the above equation becomes
Fk+2,h+1
Fk,h Fk+1,h dD,D0 ( ) = 2(h, h).

2 Fk+2,h+1 Fk,h Fk+1,h 2p 1 -3 1
Fl,2 Since h {0, 1} and p 3 (mod 4), by Lemma 1 we have
Fk,h Fk+1,h
Fk,h Fk+1,h

3 Fk+2,h+1 2p 3 -1 3 dD,D0 ( ) = 2(p 3)/4 = (p 3)/2.
Fk,2
Fk+1,2
Fk,h Fk+1,h We can obtain the values of dD,D0 ( ) in a similar manner for
Fk,h Fk+1,h

4 Fk+2,h+1 2p 3 -1 3
Fk,2
Fk+1,2 the following cases.
Fk,h Fk+1,h 3) For 1 = 0, 2 H1 , similarly, we can obtain
Fk,h Fk+1,h

5 Fk+2,h+1 2p 1 -3 1
Fk,2 Fk+1,2 dD,D0 ( ) = 2(h + 1, h + 1) = 2(p 3)/4 = (p 3)/2.
Fl,2
Fk,h Fk+1,h
F0,h F1,h 4) For 1 = 1, 2 = 0 H2 , the equation (5) reduces to

6 Fk+2,h+1 2p 1 -3 1
F2,h Fk+2,h+1
Fl,2
dD,D0 ( ) = |Hh | = (p 1)/2.
5) For 1 = 1, 2 H0 , by (5) , Lemma 2 and Lemma 3 we
Proof: Firstly, Let D = Fk,h Fk+1,h Fk+2,h+1 , D0 = have
Fk,h Fk+1,h , = f 1 (1 , 2 ), 1 Z3 , 2 Hi , i = 0, 1, 2,
then by (3) we have dD,D0 ( ) = (h + 1, h) + (h, h).

dD,D0 ( ) By Lemma 1, we know (0, 1) = (p + 1)/4, (0, 0) = (1, 0) =

(1, 1) = (p 3)/4, if p 3 (mod 4). So,
= |(Fk,h Fk+1,h ) (Fk,h Fk+1,h Fk+2,h+1 + )| 
= |Fk,h (Fk,h Fk+1,h Fk+2,h+1 + )| (p 3)/2, if h = 0,
dD,D0 ( ) =
(p 1)/2, if h = 1.
+|Fk+1,h (Fk,h Fk+1,h Fk+2,h+1 + )|
= |Fk,h (Fk,h + )| + |Fk,h (Fk+1,h + )| 6) For 1 = 1, 2 H1 , similarly, we can obtain
+|Fk,h (Fk+2,h+1 + )| + |Fk+1,h (Fk,h + )| dD,D0 ( ) = (h, h + 1) + (h + 1, h + 1)

+|Fk+1,h (Fk+1,h + )| + |Fk+1,h (Fk+2,h+1 + )| (p 1)/2, if h = 0,
=
= |{k} Hh ({k} Hh + (1 , 2 ))| (p 3)/2, if h = 1.
+|{k} Hh ({k + 1} Hh + (1 , 2 ))| 7) For 1 = 2, 2 = 0 H2 ,
+|{k} Hh ({k + 2} Hh+1 + (1 , 2 ))| dD,D0 ( ) = |Hh | = (p 1)/2.
+|{k + 1} Hh ({k} Hh + (1 , 2 ))| 8) For 1 = 2, 2 H0 ,
+|{k + 1} Hh ({k + 1} Hh + (1 , 2 ))| 
(p 3)/2, if h = 0,
+|{k + 1} Hh ({k + 2} Hh+1 + (1 , 2 ))| dD,D0 ( ) =
(p 1)/2, if h = 1.
= |{k} {k + 1 }||Hh (Hh + 2 )|
9) For 1 = 2, 2 H1 ,
+|{k} {k + 1 + 1 }||Hh (Hh + 2 )| 
(p 1)/2, if h = 0,
+|{k} {k + 2 + 1 }||Hh (Hh+1 + 2 )| dD,D ( ) =
0
(p 3)/2, if h = 1.
+|{k + 1} {k + 1 }||Hh (Hh + 2 )|
Concluding from case1-9, by (6) we can obtain the correlation
+|{k + 1} {k + 1 + 1 }||Hh (Hh + 2 )| values of (x, y) as follows.
+|{k + 1} {k + 2 + 1 }||Hh (Hh+1 + 2 )| (5) if h = 0,

It is clear that m = |D| = p 1, m0 = |D0 | = 3(p 1)/2, by 2p + 1, if = 0,
Lemma 4, we have R(x,y) ( ) = 1, if F0,0 F0,1 F1,0 F2,0 ,
3, if F1,1 F1,2 F2,1 F2,2 .

R(x,y) ( ) = 4dD,D0 ( ) 2p + 5. (6) if h = 1,

Consider several cases: 2p + 1, if = 0,
1)For 1 = 0, 2 = 0 H2 , then = 0, R(x,y) ( ) = 1, if F0,0 F0,1 F1,1 F2,1 ,
3, if F1,0 F1,2 F2,0 F2,2 .

dD,D0 ( ) = |D D0 | = |Fk,h Fk+1,h | = p 1.
Hence, the binary sequence pair (x, y) has optimal three-level
2)For 1 = 0, 2 H0 , since k Z3 , |{k} {k + 1}| = correlation values if D = Fk,h Fk+1,h Fk+2,h+1 and D0 =
|{k} {k + 2}| = |{k + 1} {k + 2}| = 0 and |{k} {k}| = Fk,h Fk+1,h .

1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2700845, IEEE
Communications Letters
IEEE COMMUNICATIONS LETTERS, VOL. , NO. , 4

The other definiting sets of (D, D0 ) in Table II can be proved Example 3: Let p = 5, = 2. Then
in a similar manner.
H0 = {1, 4}, H1 = {2, 3}, H2 = {0},
Example 2: Let p = 7, = 2, Then
F0,0 = {6, 9}, F0,1 = {3, 12}, F0,2 = {0},
H0 = {1, 2, 4}, H1 = {3, 5, 6}, H2 = {0}, F1,0 = {1, 4}, F1,1 = {7, 13}, F1,2 = {10},
F0,0 = {9, 15, 18}, F0,1 = {3, 6, 12}, F0,2 = {0}, F2,0 = {11, 14}, F2,1 = {2, 8}, F2,2 = {5}.
F1,0 = {1, 4, 16}, F1,1 = {10, 13, 19}, F1,2 = {7},
Let (D, D0 ) = (Fk,h Fk+1,h Fk+2,h+1 Fk,2 , Fk,h
F2,0 = {2, 8, 11}, F2,1 = {5, 17, 20}, F2,2 = {14}. Fk+1,h ), k = h = 0, we have
Let (D, D0 ) = (Fk,h Fk+1,h Fk+2,h+1 , Fk,h Fk+1,h ). D = F0,0 F1,0 F2,1 F0,2 = {0, 1, 2, 4, 6, 8, 9},
If k = h = 0, we have
D0 = F0,0 F1,0 = {1, 4, 6, 9}.
D = F0,0 F1,0 F2,1 = {1, 4, 5, 9, 15, 16, 17, 18, 20}, By (2) we can obtain
D0 = F0,0 F1,0 = {1, 4, 9, 15, 16, 18}.
x = (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1),
By (2) we can obtain y = (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1).

x = (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, The correlation values of (x, y) are as follows:

1, 1, 1, 1, 1, 1), {R(x,y) ( )}14
=0 = {9, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 3, 1, 1, 3}.
y = (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
Remark: All the D, except for 1 in Table II and
3 & 6 in
1, 1, 1, 1, 1, 1). Table III, have a definiting set like Fk,h Fk+1,h Fk+2,h+1
The correlation values of (x, y) are as follows: F,2 , where {k, k+1, k+2, l}. So, |D| = 3(p1)/2+1 =
(3p 1)/2 = (N 1)/2, which means that the sequence x
20
{R(x,y)( )} =0 = {15, 1, 1, 1, 1, 3, 1, 3, 1, 1, of the characteristic sequence pair (x, y) is balanced between
1s and -1s.
3, 1, 1, 3, 3, 1, 1, 3, 1, 3, 3}.

Theorem 2: For p 1 ( mod 4), the characteristic sequence IV. C ONCLUSION

pair (x, y) of (D, D0 ), defined by (2), has optimal three-level In this letter, we presented a new generalized cyclotomic
correlation if D and D0 are defined as shown in Table III. method over Z3p based on Chinese Remainder Theorem and
Where v, 1 and 2 are defined in (1). cyclotomic classes of order 2. Two families of binary sequence
pairs of period N = 3p were constructed by utilizing these
TABLE III new generalized cyclotomic classes. All the constructed binary
D EFINITING S ETS OF (D, D 0 ) A ND T HE C ORRESPONDING T HREE
C ORRELATION VALUES OF (x, y) FOR p 1 (mod 4)
sequence pairs have optimal correlation values {3, 1} or
{1, 3}, which can greatly extend the number of optimal
D D0 v 1 2 binary sequence pairs.
Fk,h Fk+1,h In practical application system, a sequence pair is consid-

1 Fk+2,h+1 Fk,h Fk+1,h 2p 1 -3 1 ered to be balanced if the sending sequence has optimum
Fk,2
Fk,h Fk+1,h balance among -1s and 1s. Notice that all the D, except for
1

2 Fk+2,h+1 Fk,h Fk+1,h 2p 1 -3 1 in Table II and 3 & 6 in Table III, have a length of (N 1)/2,
Fk+1,2 which means that the sequence x of the characteristic sequence
Fk,h Fk+1,h
Fk+2,h+1 pair (x, y) has balance among -1s and 1s. Meanwhile, if we

3 Fk,h Fk+1,h 2p 5 -3 1
F0,2 F1,2 set sequence x as the sending sequence, the sequence pair
F2,2 (x, y) is balanced. Hence most of the binary sequence pairs
Fk,h Fk+1,h
Fk,h Fk+1,h constructed in this letter are balanced.

4 Fk+2,h+1 2p + 1 -1 3
Fk,2
Fk,2
Fk,h Fk+1,h

5 Fk+2,h+1
Fk,h Fk+1,h
2p + 1 -1 3
R EFERENCES
Fk+1,2
Fk+1,2 [1] X. Q. Zhao, W. C. He, Z. W. Wang, and S. L. Jia, The theory of the
Fk,h Fk+1,h Fk,h Fk+1,h perfect binary array pairs, Acta Electronica Sinica, vol. 27, no. 1, pp.

6 2p 3 -1 3
Fk+2,h+1 Fk,2 Fk+1,2 34-37, Jan. 1999.
Fk,h Fk+1,h [2] K. T. Arasu, D. Arya and A. Bakshi, Constructions of punctured
Fk,h Fk+1,h

7 Fk+2,h+1 2p 5 -3 1 difference set pairs and their corresponding punctured binary array pairs,
Fk,2 Fk+1,2
Fk+2,2 IEEE Transactions on Information Theory, Vol. 61, No. 4, pp. 2191-2199,
Fk,h Fk+1,h 2015.
F0,h F1,h F2,h

8 Fk+2,h+1 2p 1 -3 1 [3] S. Y. Jin and H. Y. Song, Binary sequence pairs with two-level correla-
Fk+2,h+1
Fk+2,2 tion and cyclic difference pairs, IEICE Trans. Fundamentals, vol.E93-A,
no.11, pp. 2266-2271, 2010.
[4] H. L. Jin and C. Q. Xu, The study of methods for constructing a family
Proof: The conclusion follows by using the same ap- of pseudorandom binary sequence pairs based on the cyclotomic class,
proach as in Theorem 1. Acta Electronica Sinica, vol. 38, no. 7, pp. 1608-1611, Jul. 2010.

1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2700845, IEEE
Communications Letters
IEEE COMMUNICATIONS LETTERS, VOL. , NO. , 5

[5] X. Peng, C. Xu, and K. T. Arasu, New famimilies of binary sequence

pairs with two-level and three-level correlation, IEEE Transactions on
Information Theory, Vol. 58, No. 11, pp. 6968-6978, 2012.
[6] X. Peng, C. Xu, G. Li, and K. T. Arasu, The constructions of almost
binary sequence pairs and binary sequence pairs with three-level autocor-
relation, IEICE Trans. Fundam. Electron., Commun. Comput. Sci., vol.
E94-A, no. 9, pp. 1886-1891, 2011.
[7] C. Ding, T. Hellesenh, H. M. Martinsen, New families of binary
sequences with optimal three-level autocorrelation, IEEE Transactions
on Information Theory, vol. IT-47, pp. 428-433, 2001.
[8] T. W. Cusick, C. Ding, A. Renvall, Stream Ciphers and Number Theory,
Amsterdam, Elsevier, 1998.
[9] M. Hall, Combinatorial Theory, New York, Wiley, New York, 1975.
[10] C. Ding, D. Pei, and A. Salomaa, Chinese Remainder Theorem: Applica-
tions in Computing, Coding, Cryptography. Singapore: World Scientific,
1996.
[11] K. Liu and C. Q. Xu, On binary sequence pairswith two-level periodic
autocorrelation function, IEICE Trans. Funda., vol. E93-A, no. 11, pp.
22782285, Nov. 2010.

1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.