Linear complexity of generalized cyclotomic sequences of period $$2p^{m}$$ |
SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal …

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 …

Sequences with high linear complexity property are of importance in applications. In this
paper, based on the theory of generalized cyclotomy, new classes of quaternary generalized …

In this paper, we construct new q-ary generalized cyclotomic sequences of length 2 p^ n. We
study the linear complexity of these sequences over the finite field of order q and show that …

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 …

The linear complexity of a sequence is an important parameter in its evaluation as a
keystream cipher for cryptographic applications. Using of cyclotomic classes to construct …

In this paper, we study the k-error linear complexity of binary sequences with periods pn,
which are derived from new generalized cyclotomic classes modulo a power of an odd …

In this paper, we continue to study the linear complexity of new gener-alized cyclotomic
sequences. The generalized cyclotomic classes modulo pnqm are used for the definition of …

Sidelnikov sequences, a kind of cyclotomic sequences with many desired properties such as
low correlation and variable alphabet sizes, can be employed to construct a polyphase …

Abstract **ao, Zeng, Li and Helleseth proposed new generalized cyclotomic binary
sequences s∞ of period pm and showed that these sequences are almost balanced and …