Abstract — This paper demonstrates a generation method for G-correlated integer-valued sequences using modified linear feedback shift registers. We start from the well-known fact that M-sequence generation by conventional linear feedback shift registers approximates the Bernoulli map. Changing the next state map in such a way that it approximates the tent map, leads to sequences with nearly two-valued autocorrelation functions. The proposed method can be extended to the approximation of arbitrary maps in order to generate sequences with given autocorrelation properties. I
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedb...
A new construction of a pseudo-random generator based on a simple combination of three feedback shif...
We continue the research of Jansen et al. (IEEE Trans on Information Theory 1991) to construct De Br...
Post-processing scheme using linear feedback shift registers (LFSRs) for generat-ing chaos-based ran...
Post-processing scheme using linear feedback shift registers (LFSRs) for generat-ing chaos-based ran...
AbstractA generalized feedback shift register (GFSR) algorithm proposed by Lewis and Payne (1973) us...
AbstractA generalized feedback shift register (GFSR) algorithm proposed by Lewis and Payne (1973) us...
In this thesis we focus on two main properties of sequences which have wide range of applications in...
This paper describes a formal basis for pseudorandom signal generation by means of linear feedback s...
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest line...
The article deals with a new method for modeling a pseudorandom number generator based on R-blocks. ...
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest line...
The design of pseudorandom sequences with optimal correlation properties forms a crucial part of com...
A class of pseudorandom sequences over GF(pm) which are the generalization of m-sequences are constr...
In this paper, we will show that a simple one dimension non-linear map allows generating symbolic se...
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedb...
A new construction of a pseudo-random generator based on a simple combination of three feedback shif...
We continue the research of Jansen et al. (IEEE Trans on Information Theory 1991) to construct De Br...
Post-processing scheme using linear feedback shift registers (LFSRs) for generat-ing chaos-based ran...
Post-processing scheme using linear feedback shift registers (LFSRs) for generat-ing chaos-based ran...
AbstractA generalized feedback shift register (GFSR) algorithm proposed by Lewis and Payne (1973) us...
AbstractA generalized feedback shift register (GFSR) algorithm proposed by Lewis and Payne (1973) us...
In this thesis we focus on two main properties of sequences which have wide range of applications in...
This paper describes a formal basis for pseudorandom signal generation by means of linear feedback s...
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest line...
The article deals with a new method for modeling a pseudorandom number generator based on R-blocks. ...
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest line...
The design of pseudorandom sequences with optimal correlation properties forms a crucial part of com...
A class of pseudorandom sequences over GF(pm) which are the generalization of m-sequences are constr...
In this paper, we will show that a simple one dimension non-linear map allows generating symbolic se...
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedb...
A new construction of a pseudo-random generator based on a simple combination of three feedback shif...
We continue the research of Jansen et al. (IEEE Trans on Information Theory 1991) to construct De Br...