About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
classification
💻 cs.IT
cs.CRmath.IT
keywords
complexitylinearsequencesding-hellesethgeneralizedperiodarbitrarybinary
read the original abstract
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 computing the linear complexity of Ding-Helleseth sequences in the general case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.