19 citations · 47 across the 12 of their papers we have counts for
Showing 2019 · cs.ITShow all
2 papers · 2 filters
cs.IT2019
New Successor Rules to Efficiently Produce Exponentially Many Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Pinhui Ke +1
We put forward new general criteria to design successor rules that generate binary de Bruijn sequences. Prior fast algorithms based on successor rules in the literature are then sh…
cs.IT2019★ 8 cited
On Greedy Algorithms for Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback fu…