DOIAbstract
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedback shift register. Properties of the number of sequences in the minimum and maximum weight classes of the generator functions are discussed
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedback shift register. Properties of the number of sequences in the minimum and maximum weight classes of the generator functions are discussed
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Oppo...
Abstract. Any span n sequences can be regarded as filtering sequences. From this observation, new ra...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
We consider the symmetric Feedback Shift Registers (FSRs), especially a special class of symmetric F...
We continue the research of Jansen et al. (IEEE Trans on Information Theory 1991) to construct De Br...
De Bruijn sequence is an important kind of nonlinear shift register sequence, which has a very wide ...
AbstractOrder n modified de Bruijn sequences are created by removing a single zero from the longest ...
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial f(x) = p(...
AbstractThe deBruijn sequences of order n are divided into weight classes. A method is given for def...
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback sh...
AbstractA study is made of the number of cycles of length k which can be produced by a general n-sta...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Oppo...
Abstract. Any span n sequences can be regarded as filtering sequences. From this observation, new ra...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
We consider the symmetric Feedback Shift Registers (FSRs), especially a special class of symmetric F...
We continue the research of Jansen et al. (IEEE Trans on Information Theory 1991) to construct De Br...
De Bruijn sequence is an important kind of nonlinear shift register sequence, which has a very wide ...
AbstractOrder n modified de Bruijn sequences are created by removing a single zero from the longest ...
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial f(x) = p(...
AbstractThe deBruijn sequences of order n are divided into weight classes. A method is given for def...
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback sh...
AbstractA study is made of the number of cycles of length k which can be produced by a general n-sta...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Oppo...
Abstract. Any span n sequences can be regarded as filtering sequences. From this observation, new ra...
Add to ORKG