arXiv · 1912.06134
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products
Abstract
This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.
Explore related subjects
Keep this discovery
Ming Yan, Tongjiang Yan, Yu Li. 2019-12-13. Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products. https://arxiv.org/abs/1912.06134
Cite the original work for its findings. Save a collection to share your selection of sources.