About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
Vladimir Edemskiy
TL;DR
This paper establishes conditions for designing Ding-Helleseth generalized cyclotomic binary sequences with arbitrary periods and high linear complexity, and discusses methods for computing their linear complexity.
Contribution
It introduces sufficient conditions for constructing sequences with arbitrary periods and high linear complexity, and provides a general method for linear complexity computation.
Findings
Sequences can be designed with arbitrary periods and high linear complexity.
A method for computing linear complexity of Ding-Helleseth sequences is proposed.
Theoretical conditions for sequence construction are established.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems