V. Edemskiy

activity

20122021

most citedThe linear complexity of new binary cyclotomic sequences of period

p^{n}

5 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.CR2019

On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p

Chenhuang Wu, Vladimir Edemskiy, Chunxiang Xu

We consider the $k$ -error linear complexity of binary sequences derived from Eluer quotients modulo $2 p$ ( $p > 3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We ad…

math.NT2019

Note about the linear complexity of new generalized cyclotomic binary sequences of period $2 p^{n}$

Vladimir Edemskiy

This paper examines the linear complexity of new generalized cyclotomic binary sequences of period $2 p^{n}$ recently proposed by Yi Ouang et al. (arXiv:1808.08019v1 [cs.IT] 24 Aug 20…

On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p

Note about the linear complexity of new generalized cyclotomic binary sequences of period 2pn

Note about the linear complexity of new generalized cyclotomic binary sequences of period $2 p^{n}$