We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary
sequences by using cyclotomic numbers of order four,“Gauss periods” and “quadratic Gauss …

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 …

The generalized binary sequences of order 2 have been used to construct good binary
cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The …

The purpose of this paper is to determine the 4-adic complexity of the balanced quaternary
sequences of period 2 (2 n− 1) with ideal autocorrelation defined by Jang et al.(ISIT, pp. 278 …

The purpose of this paper is to determine the p‐adic complexity of the Ding‐Helleseth‐
Martinsen (DHM) sequences with period N= 2q, where q= 5 (mod 8) is a prime number. We …

Three constructions of binary sequences with period 4 N and optimal autocorrelation value
or optimal autocorrelation magnitude have been presented by Tang and Gong based on …

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 …

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences with optimal
autocorrelation magnitude was constructed (Des. Codes and Cryptogr., 2018). Later, Sun et …

In this paper, we study the 4-adic complexity of two classes of quaternary sequences of
period 2p with ideal autocorrelation defined by Kim et al.(ISIT, 2009). Our results show that …