In this paper, a new method is presented to compute the 2-adic complexity of pseudo-
random sequences. With this method, the 2-adic complexities of all the known sequences …

Abstract R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-prime
(binary) generator of period pq with two odd primes p≠ q is close to its period and it can …

We show that there is a very simple approach to determine the 2-adic complexity of periodic
binary sequences with ideal two-level autocorrelation. This is the first main result by H …

In this paper, 2-adic complexity of some binary sequences with interleaved structure is
investigated. Firstly, 2-adic complexity of low correlation zone (LCZ) sequences constructed …

A significant difference between the linear complexity and the 2-adic complexity of periodic
binary sequences is pointed out in this correspondence. Based on this observation, we …

In this paper, we consider two kinds of quaternary sequences, ie, quaternary classical
cyclotomic sequences with period q where q is an odd prime, and quaternary Ding …

Symmetric 2-adic complexity is a better measure for assessing the strength of a periodic
binary sequence against the rational approximation attack. We study the symmetric 2-adic …

Tang–Gong interleaved sequences constructed from the generalized GMW sequence pair
are a class of binary sequences with optimal autocorrelation magnitude. In this paper, the …

In this paper, we consider Ding-Helleseth generalized cyclotomic sequences of length pq
where p and q are odd distinct primes. We derive symmetric 2-adic complexity of these …

This paper is devoted to studying the symmetric 2-adic complexity of sequences with optimal
autocorrelation magnitude and period 8 q, where q is a prime satisfying q≡ 5 (mod 8) …