  The autocorrelation values of two classes of binary sequences are shown to be
good in [6]. We study the 2-adic complexity of these sequences. Our results
show that the 2-adic complexity of such sequences is large enough to resist the
attack of the rational approximation algorithm.
