10 citations · 19 across the 9 of their papers we have counts for
9 papers
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…
Note about the linear complexity of new generalized cyclotomic binary sequences of period
Vladimir Edemskiy
This paper examines the linear complexity of new generalized cyclotomic binary sequences of period recently proposed by Yi Ouang et al. (arXiv:1808.08019v1 [cs.IT] 24 Aug 20…
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…
The linear complexity of new binary cyclotomic sequences of period
Vladimir Edemskiy
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-…