2000 character limit reached
On Greedy Algorithms for Binary de Bruijn Sequences
Published 23 Feb 2019 in cs.IT, cs.DS, math.CO, and math.IT | (1902.08744v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
