Let be a binary sequence of period , . The autocorrelation function of the sequence is defined by
For , Let
For many applications in communication, the value of Max is required as small as possible. It is easy to see that when , for all For , a binary sequence with period is called to have perfect autocorrelation if Max It is conjectured that the only perfect sequence is and up to (cyclic shift) equivalence. For , a binary sequence with period is called to have ideal autocorrelation if for all Several series of binary sequences with ideal autocorrelation have been found (-sequences, Hall sequences, Paley sequences and the twin-prime sequences, see ). A binary sequence with period is called to have optimal autocorrelation if Max and 3 for respectively. For a list of known binary sequences with optimal autocorrelation we refer to .
In the application on cryptography, binary sequences, as candidates of keys in stream cipher system, are required to have big “complexity”. There are huge works on linear complexity of binary sequences. The sequences with linear complexity can be generated by a linear shift register of length . Since the end of last century, the 2-adic complexity has been viewed as one of the important security criteria of sequences. The sequences with 2-adic complexity can be generated by a feedback (with carry) shift register of length ().
Let be a binary sequence with period Let The 2-adic complexity of is defined by
Comparing with the linear complexity, the 2-adic complexity of binary sequences with small autocorrelation has not been fully researched. The 2-adic complexity of the binary sequences with ideal autocorrelation for has been done in [12, 14, 5]. Particularly, H. Hu  presented a neat approach to show that for all known ideal binary sequences with period , their 2-adic complexity reaches the maximum value
For some other sequences with good autocorrelation, the 2-adic complexity is determined or estimated by a nice lower bound [4, 9-11, 13].
In this paper, we determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary sequences. The sequences has period where is a prime number, and optimal autocorrelation Max We will determine their 2-adic complexity. For doing this we use the cyclotomic numbers of order four and develop “Gauss periods” and quadratic “Gauss sum” on finite field valued in the ring .
We introduce the construction on the DHM sequences and preliminaries on cyclotomic numbers, “Gauss periods” and quadratic “Gauss sum” in Section 2. Then we present upper and lower bounds on the 2-adic complexity of the DHM sequences in Section 3. After further consideration we finally determine the exact value of the 2-adic complexity of the DHM sequences in Section 4.
2.1 Ding-Helleseth-Martinsen (DHM) sequences
Let be a prime number, . It is well known that there exists unique up to their signs such that . Let and . Then is a subgroup of , and the cosets of in
are called as cyclotomic classes of order four in .
Let We have the following isomorphism of rings
The inverse of is
Consider the following subset of , for
Definition 2.1 Let be a prime number, be the cyclotomic classes of order four defined by (2.1). Let be the subset of defined by (2.2). The Ding-Helleseth-Martinsen (DHM) binary sequence and with period is defined by
Namely, and for .
It is proved in  that if
then the DHM sequence has optimal autocorrelation for
then the DHM sequences has optimal autocorrelations.
In Section 3 we present upper and lower bounds for the DHM sequence satisfying condition (2.3) and satisfying condition (Theorem 3.1 and 3.2). After further consideration we totally determine the value of and in Section 4 (Theorem 4.2 and 4.4).
2.2 Cyclotomic Numbers of Order Four
Let be a prime number, , and be the cyclotomic classes of order four in .
Definition 2.2 The cyclotomic numbers of order four in are defined by, for
The values of has been computed (see  or ).
Lemma 2.3 Let be a prime number, and . The values of the cyclotomic numbers of order four in are
2.3 “Gauss periods” of order four and quadratic “Gauss sum”
Since implies we can define the following mapping
where is the group of units in the ring . is a homomorphism of groups from to , and can be viewed as an additive character of finite field valued in . Then we have the “Gauss periods” of order 4
and quadratic “Gauss sum”
where is the unique quadratic (multiplicative) character of (the Legendre symbol). Namely, for ,
The following results show that and have some similar properties as usual Gauss periods and Gauss sums. (The proofs are also similar).
Lemma 2.4 (1). .
(2). For , where is the cyclotomic numbers of order four on and
(1). In the following, all equality means
The contribution of to the right-hand side is
(remark that for Therefore
(2). By the definition of ,
From we know that and
Then we get
Remark From Lemma 2.4(2) we know that
By Lemma 2.3 we get
From (2.4) and (2.5) we get
Lemma 2.5 Let be a prime number, Then
Lemma 2.6 Assume that is a prime number and . Then
By Lemma 2.5,
We get .
Similarly, we get
Since , by Lemma 2.5, we get
3 Upper and Lower Bounds of and
In this section we present upper and lower bounds of 2-adic complexity of DHM sequences.
Theorem 3.1 Let be the DHM binary sequence with period defined in Definition 2.1, be a prime number, If the condition (2.3) holds, then , where
The 2-adic complexity of is , where , and . We need to estimate the value . From and , we know that
By the definition of the sequence , we have
Let . From we know that 2 is not a square in Therefore or 3 and
(A). Firstly we prove .
The assumption implies On the other hand,
we get Therefore Moreover, if , then . The order of is 6, we get which implies that since is a prime number. This contradicts to assumption Thus and where
Now we prove By (3.1),
where or 3. We consider the four cases of the condition (2.3) separately.
(1). For and , we have by (3.2) and or 3. Namely, or . Then or . In both cases,
From Lemma 2.4 we have
Therefore and . We get
(2). For and , we have . Namely, or and or . In both of cases,
Therefore and we also get as in case (1).
(3). For and we have . Namely, or Therefore
From we get . Therefore and Then we get .
(4). At last, for and , we have . Namely, or . Therefore
We also get .
In summary, we have proved that for all four cases.
Now we prove that . If , let be a prime divisor of . Then , or . If , we get which contradicts to . If from we know that the order of is . Therefore which contradicts to . Therefore and then for all four cases.
This implies that .
(B). Now we prove that .
From (3.1) we know that