On Greedy Algorithms for Binary de Bruijn Sequences

02/23/2019

∙

by   Zuling Chang, et al.

∙

0

∙

share

We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm.