An efficient algorithm for generation of de Bruijn sequences over ring F_2+uF_2 by raising stage
Wu Bo
Abstract
Wu Bo
Abstract
A sur-homomorphism D from n-stage de Bruijn-Good graph to (n-1)-stage de Bruijn-Good graph over ring F2+uF2 was defined. It was proved an algorithm for generating n-stage de Bruijn sequences from a given feedback function of (n-1)-stage de Bruijn sequences. Furthermore,an efficient algorithm for generating n-stage de Bruijn sequences from a given feedback function of lower m-stage de Bruijn sequences by raising stage was given.
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.
A sur-homomorphism D from n-stage de Bruijn-Good graph to (n-1)-stage de Bruijn-Good graph over ring F2+uF2 was defined. It was proved an algorithm for generating n-stage de Bruijn sequences from a given feedback function of (n-1)-stage de Bruijn sequences. Furthermore,an efficient algorithm for generating n-stage de Bruijn sequences from a given feedback function of lower m-stage de Bruijn sequences by raising stage was given.
Key concepts: De Bruijn sequence, De Bruijn graph, Mathematics, Combinatorics, Stage (stratigraphy), Homomorphism, Graph, Ring (chemistry)