10 citations · 14 across the 9 of their papers we have counts for
10 papers
Arithmetic Autocorrelation of Binary -Sequences
Zhixiong Chen, Zhihua Niu, Yuqi Sang +1
An -sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balan…
Correlation measures of binary sequences derived from Euler quotients
Huaning Liu, Zhixiong Chen, Chenhuang Wu
Fermat-Euler quotients arose from the study of the first case of Fermat's Last Theorem, and have numerous applications in number theory. Recently they were studied from the cryptog…
Asymptotically optimal codebooks derived from generalised bent functions
Qiuyan Wang, Yang Yan, Chenhuang Wu +1
Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes…
A kind of quaternary sequences of period and their linear complexity
Qiuyan Wang, Chenhuang Wu, Minghui Yang +1
Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over with period is constr…
Multisequences with high joint nonlinear complexity from function fields
Yang Yan, Qiuyan Wang, Chenhuang Wu
Multisequences over finite fields play a pushing role in the applications that relate to parallelization, such as word-based stream ciphers and pseudorandom vector generation. It i…
On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p
Chenhuang Wu, Vladimir Edemskiy, Chunxiang Xu
We consider the -error linear complexity of binary sequences derived from Eluer quotients modulo ( is an odd prime), recently introduced by J. Zhang and C. Zhao. We ad…
On -error linear complexity of pseudorandom binary sequences derived from Euler quotients
Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke +1
We investigate the -error linear complexity of pseudorandom binary sequences of period derived from the Euler quotients modulo , a power o…
A further study on the linear complexity of new binary cyclotomic sequence of length
Zhifan Ye, Pinhui Ke, Chenhuang Wu
Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic binary sequences of period was proposed by Z. Xiao et al. (Des. Codes Cryptogr., DOI…
Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes
Xina Zhang, Xiaoni Du, Chenhuang Wu
A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity…
On error linear complexity of new generalized cyclotomic binary sequences of period
Chenhuang Wu, Chunxiang Xu, Zhixiong Chen +1
We consider the -error linear complexity of a new binary sequence of period , proposed in the recent paper "New generalized cyclotomic binary sequences of period ", by…