5 citations · 6 across the 2 of their papers we have counts for
3 papers
math.NT2017★ 5 cited
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-…
math.NT2016
Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p
Zhixiong Chen, Vladimir Edemskiy
We determine the exact values of the linear complexity of 2p-periodic quaternary sequences over Z_4 (the residue class ring modulo 4) defined from the generalized cyclotomic classe…
cs.IT2012★ 1 cited
About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
Vladimir Edemskiy
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of…