Loading [MathJax]/extensions/MathZoom.js
Zhihua Niu - IEEE Xplore Author Profile

Showing 1-6 of 6 results

Filter Results

Show

Results

The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another figure of merit introduced by Goresky and Klapper generalizing Mandelbaum’s arithmetic autocorrelation. First we observe that the arithmetic crosscorrelation is constant for two binary sequences of coprime periods, which...Show More
Since the K-Means algorithm was proposed, it has been widely concerned by researchers. Its advantage lies in its simplicity and efficiency, but it also has shortcomings. Aiming at the problems that random selection of initial clustering centers in K-Means algorithm may lead to the algorithm falling into a local optimal solution, making the clustering results unstable and the K-value need to be det...Show More
The pn-periodic q-ary sequence with high linear complexity and high k-error linear complexity is defined as excellent sequence. With appropriate fitness function and parameters, this paper design a genetic algorithm to generate the N-periodic q-ary excellent sequences, where N=27, 81, , 2187, and get some laws of k-error linear complexity and linear complexity, here p is an odd prime and q is a pr...Show More
With the rapid development of web service applications and the changing demands of enterprise business, more and more web services are combined into several sequences for some complex tasks in order to reduce the costs and improve the efficiency. Therefore, how to integrate the existed web services to form more complex services to meet the personalized needs for different users, which provide a va...Show More
Cryptographic sequences with high linear complexity and high k-error linear complexity are called excellent sequences. In this paper, we design a genetic algorithm to generate an excellent pn-periodic binary sequence. With the genetic algorithm, we do some numerical experiments to study the character of the excellent sequences. We get some interesting results when k satisfies k = pr(0 <; r <; n), ...Show More
To ensure the security of the data during transmission, the data should be encrypted by a key stream sequence which should be strong enough with good randomness and unpredictability. Cryptographically strong sequences should not only have a large linear complexity, but also the change of a few terms should not cause a significant decrease of the linear complexity. This requirement leads to the the...Show More