activity
20122021
most citedThe linear complexity of new binary cyclotomic sequences of period

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

collaborators
Showing cs.ITShow all

1 paper · 1 filter

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…