  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.
