5 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
On the 4-adic complexity of the two-prime quaternary generator
Vladimir Edemskiy, Zhixiong Chen
R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-prime (binary) generator of period with two odd primes is close to its period and it can attai…
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…
About the k-Error Linear Complexity over of sequences of length 2 with optimal three-level autocorrelation
Vladimir Edemskiy
We investigate the -error linear complexity over of binary sequences of length with optimal three-level autocorrelation. These balanced sequences are constru…
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…