Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
Tongjiang Yan
TL;DR
This paper determines the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences for any order, providing insights into their cryptographic strength.
Contribution
It offers a comprehensive analysis of the linear complexity for these sequences of any order, extending previous limited results.
Findings
Linear complexity computed for sequences of any order
Results applicable to cryptographic sequence design
Enhanced understanding of sequence security properties
Abstract
This paper gives the linear complexity of binary Ding-Helleseth generalized cyclotomic sequences of any order.
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