Algorithm of generating binary de Bruijn sequences

The de Bruijn sequences are the longest nonlinear shift register sequences.The weight of cycles of GPCR is defined in this paper.By making use of the characteristic of the weight,a new recursive algorithm is presented for the generation of binary de Bruijn sequences.It generates 2s·g(n,s) de Bruijn sequences of span,of which 1≤s≤2(n-4)2,g(n,s)=n-2l-6-[n-2l-6l+1].