Abstract
This paper contributes to compute the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that the 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have