2000 character limit reached
On Greedy Algorithms for Binary de Bruijn Sequences (1902.08744v2)
Published 23 Feb 2019 in cs.IT, cs.DS, math.CO, and math.IT
Abstract: 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.