• Corpus ID: 13913032

State Diagrams of a Class of Singular LFSR and Their Applications to the Construction of de Bruijn Cycles

  title={State Diagrams of a Class of Singular LFSR and Their Applications to the Construction of de Bruijn Cycles},
  author={Xiaofang Wang and Yujuan Sun and Weiguo Zhang},
The state diagrams of a class of singular linear feedback shift registers (LFSR) are discussed. It is shown that the state diagrams of the given LFSR have special structures. An algorithm is presented to construct a new class of de Bruijn cycles from the state diagrams of these singular LFSR. 


The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
In this paper, the cycle structure and adjacency graphs of a class of linear feedback shift registers are determined and a new family of maximum-length nonlinear Feedback shift registers (NFSRs) are proposed based on the properties of these LFSRs.
A Class of de Bruijn Sequences
To illustrate the efficiency of constructing de Bruijn sequences from these LFSRs, an algorithm for producing some corresponding maximum-length nonlinear feedback shift registers with time and memory complexity O(n) is proposed.
The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
The cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field is determined and a method to find a state and a new way to represent the state are proposed.
Construction of de Bruijn sequences from product of two irreducible polynomials
A method to determine a state belonging to each cycle and a generic algorithm to find all conjugate pairs shared by any pair of cycles are given and an estimate of the number of resulting sequences is given.
Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)n
It is shown that the set of cycles of a linear feedback shift register with characteristic polynomial (1 + x)n are at most doubly adjacent.
Extreme weight classes of de Bruijn sequences
  • G. Mayhew
  • Computer Science, Mathematics
    Discret. Math.
  • 2002
Order 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
De Bruijn sequences, irreducible codes and cyclotomy
The cycle join algorithm is used to generate de Bruijn sequences from irreducible cyclic codes and the number of sequences obtained is related to the cyclotomic numbers.
Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
It is proved that for any integer n ≥ 8, the algorithm can produce n-stage maximum-length NFSRs with time complexity as low as O(n<sup>loglog(n)</sup>).
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
Shift registers have been used to generate sequences of 0’s and 1’s for over thirty years. A wide variety of applications has been made of these sequences. Principally, communications have made use
Cryptographically Strong de Bruijn Sequences with Large Periods
  • K. Mandal, G. Gong
  • Mathematics, Computer Science
    Selected Areas in Cryptography
  • 2012
A compact representation of an (n + 16)-stage nonlinear feedback shift register (NLFSR) and a few examples of de Bruijn sequences of period 2 n , 35 ≤ n ≤ 40, which are generated by the recursively constructed NLFSR together with the evaluation of their implementation.