On Greedy Algorithms for Binary de Bruijn Sequences
Information Theory
2021-05-27 v2 Data Structures and Algorithms
Combinatorics
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.
Cite
@article{arxiv.1902.08744,
title = {On Greedy Algorithms for Binary de Bruijn Sequences},
author = {Zuling Chang and Martianus Frederic Ezerman and Adamas Aqsa Fahreza},
journal= {arXiv preprint arXiv:1902.08744},
year = {2021}
}