10 citations · 14 across the 9 of their papers we have counts for
5 papers · 1 filter
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…