We introduce a new type of sequences using the sum of coefficients of characteristic polynomials for elements (in particular, primitive elements) in a finite field. These sequences are nonlinear filtering sequences of the well-known m-sequences. We show that they have large linear complexity and large period. We also provide some examples of such binary sequences with good autocorrelation values
Some of the techniques of deriving binary sequences from chaotic function is defined in the literatu...
In this correspondence, we present a construction for binary sequences {s(t)} of period N = p(m) - 1...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
Binary sequences with optimal autocorrelation are needed in many applications. Two constructions of ...
It is shown that the method of estimation of exponential sums with nonlinear recurring sequences, in...
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
International audienceIn Fq, Dartyge and Sarkozy introduced the notion of digits and studied some pr...
This paper proposes a new approach for generating pseudo random multi-valued (including binary-value...
International audienceAutomatic sequences are not suitable sequences for cryptographic applications ...
Abstract — In this paper we study families of generalized geometric sequences formed by applying a f...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
This paper proposes a new approach for generating pseudo random multi-valued (including binary-value...
This paper proposes a new approach for generating pseudo random multi-valued (including binary-value...
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. Th...
Some of the techniques of deriving binary sequences from chaotic function is defined in the literatu...
Some of the techniques of deriving binary sequences from chaotic function is defined in the literatu...
In this correspondence, we present a construction for binary sequences {s(t)} of period N = p(m) - 1...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
Binary sequences with optimal autocorrelation are needed in many applications. Two constructions of ...
It is shown that the method of estimation of exponential sums with nonlinear recurring sequences, in...
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
International audienceIn Fq, Dartyge and Sarkozy introduced the notion of digits and studied some pr...
This paper proposes a new approach for generating pseudo random multi-valued (including binary-value...
International audienceAutomatic sequences are not suitable sequences for cryptographic applications ...
Abstract — In this paper we study families of generalized geometric sequences formed by applying a f...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
This paper proposes a new approach for generating pseudo random multi-valued (including binary-value...
This paper proposes a new approach for generating pseudo random multi-valued (including binary-value...
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. Th...
Some of the techniques of deriving binary sequences from chaotic function is defined in the literatu...
Some of the techniques of deriving binary sequences from chaotic function is defined in the literatu...
In this correspondence, we present a construction for binary sequences {s(t)} of period N = p(m) - 1...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
DOI
Add to ORKG