19 citations · 47 across the 12 of their papers we have counts for
Showing 2020 · cs.ITShow all
2 papers · 2 filters
cs.IT2020
A Graph Joining Greedy Approach to Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +1
Using greedy algorithms to generate de Bruijn sequences is a classical approach that has produced numerous interesting theoretical results. This paper investigates an algorithm whi…
cs.IT2020★ 5 cited
An Efficiently Generated Family of Binary de Bruijn Sequences
Yunlong Zhu, Zuling Chang, Martianus Frederic Ezerman +1
We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with feedback function $f(x_0, x_1, \ldots, x_{n-1}) = x_0…