We give the trace representation of a family of binary sequences derived from Euler
quotients by determining the corresponding defining polynomials. The result extends an …

Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic
binary sequences of period p^ r pr was proposed by **ao et al.(Des Codes Cryptogr 86 (7) …

We investigate the $ k $-error linear complexity of pseudorandom binary sequences of
period $ p^{\mathfrak {r}} $ derived from the Euler quotients modulo $ p^{\mathfrak {r}-1} $, a …

Given a binary sequence, its trace representation allows us to reconstruct itself efficiently
and to analyze its properties, such as the linear complexity. In this paper, we study a family …

Binary sequences with large linear complexity have been found many applications in
communication systems. We determine the linear complexity of a family of p2‐periodic …

We first introduce a family of binary pq 2-periodic sequences based on the Euler quotients
modulo pq, where p and q are two distinct odd primes and p divides q-1. The minimal …

In this paper, a family of binary sequences derived from Euler quotients with RSA modulus
pq is introduced. Here two primes p and q are distinct and satisfy gcd(pq,(p-1)(q-1))=1. The …

For an odd prime p and positive integers r, d such that 0< d≤ pr, a generic construction of d‐
ary sequence based on Euler quotients is presented in this paper. Compared with the …

In this paper, we present a generic construction of r-ary sequences with period pq 2 based
on the Euler quotient modulo pq, where p and q are odd primes satisfying that p divides q− 1 …

We consider the k-error linear complexity of a new generalized cyclotomic binary sequence
of period p 2 for an odd prime p. The new sequences were introduced recently by Z. **ao, X …