Linear Complexity of de Brujin Sequences - Old and New Results

The linear complexity of a de Bruijn sequence is the degree of the shortest linear recursion which generates the sequence. It is well known that the complexity of a binary de Bruijn sequence of length 2/sup n/ is bounded below by 2/sup n-1/+n and above by 2/sup n-/1 for n/spl ges/3. We briefly survey the known knowledge in this area. Some new results are also presented, in particular, it is shown that for each interval of length 2/sup [log n]+1/ in the above range, there exist binary de Bruijn sequences of length 2/sup n/ with linear complexity in the interval.

[1]  Tuvi Etzion,et al.  On the distribution of de Bruijn sequences of given complexity , 1984, IEEE Trans. Inf. Theory.

[2]  Edwin L. Key,et al.  An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[3]  Peter A. Hines.  Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields , 1998, J. Comb. Theory, Ser. A.

[4]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[5]  Richard A. Games,et al.  On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.

[6]  Tuvi Etzion.  On the Distribution of de Bruijn Sequences of Low Complexity , 1985, J. Comb. Theory, Ser. A.

[7]  Richard A. Games.  There Are No De Bruijn Sequences of Span n with Complexity 2n-1+n+1 , 1983, J. Comb. Theory, Ser. A.

[8]  Richard A. Games,et al.  A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.

[9]  Richard A. Games,et al.  A generalized recursive construction for de Bruijn sequences , 1983, IEEE Trans. Inf. Theory.

[10]  Tuvi Etzion,et al.  Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.

[11]  Tuvi Etzion,et al.  Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.

[12]  Abraham Lempel,et al.  On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.

[13]  Kenneth G. Paterson,et al.  Permutation Polynomials, de Bruijn Sequences, and Linear Complexity , 1996, J. Comb. Theory, Ser. A.

[14]  Solomon W. Golomb.  Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences , 1968, Inf. Sci..

[15]  H. Fredricksen.  A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[16]  Abraham Lempel,et al.  Cryptology in Transition , 1979, CSUR.

[17]  Tuvi Etzion.  On the distribution of de Bruijn CR-sequences , 1986, IEEE Trans. Inf. Theory.