In this letter we introduce new generalized cyclotomic sequences of order two and length pq firstly, then we determine the linear complexity and autocorrelation values of these sequences. Our results show that these sequences are rather good from the linear complexity viewpoint.

In wireless networks, how to provide reliable data transfer is an important and challenging issue due to channel fading and interference. Several approaches, e.g., Automatic Repeat reQuest (ARQ), Hybrid ARQ (HARQ) and Network Coding (NC), are used to enhance reliability of transmission in wireless networks. However, we note that these schemes implement the data recovery process for mixed unicast and multicast (MUM) communications by simply separating the process into two phases, unicast and multicast phase. This is inefficient and expensive. In this paper, we propose an efficient retransmission scheme with network coding for MUM transmission, aiming at improving bandwidth utilization. UMNC searches for coding opportunities from both unicast and multicast flows, which offer the potential benefit of improved recovery in the event of packet loss. We theoretically prove that UMNC can effectively reduce the total number of retransmissions and thus improve bandwidth efficiency, compared with existing schemes.

An upper bound is established for certain exponential sums on the rational points of an elliptic curve over a residue class ring ZN , N=pq for two distinct odd primes p and q. The result is a generalization of an estimate of exponential sums on rational point groups of elliptic curves over finite fields. The bound is applied to showing the pseudorandomness of a large family of binary sequences constructed by using elliptic curves over ZN .