Rui Yi-he
Abstract
De Bruijn sequences,i.e.M sequences,are the longest nonlinear shift register sequences.The pairs of cycles of G__(PCR) are defined in this paper.By use of the character of the pairs,a new recursive algorithm is presented for the generation of binary M sequences.It generates 2~~(s·g(n,s)) M sequences of span.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
De Bruijn sequences,i.e.M sequences,are the longest nonlinear shift register sequences.The pairs of cycles of G__(PCR) are defined in this paper.By use of the character of the pairs,a new recursive algorithm is presented for the generation of binary M sequences.It generates 2~~(s·g(n,s)) M sequences of span.
Key concepts: De Bruijn sequence, Algorithm, Binary number, Character (mathematics), Pseudorandom binary sequence, Complementary sequences, Shift register, Sequence (biology)