Abstract | ||
---|---|---|
We present a simple framework for constructing de Bruijn sequences, and more generally, universal cycles, via successor rules. The framework is based on the often used method of joining disjoint cycles. It generalizes four previously known de Bruijn sequence constructions and is applied to derive three new and simple de Bruijn sequence constructions. Four of the constructions apply the pure cycling register and three apply the complemented cycling register. The correctness of each new construction is easily proved using the new framework. Each of the three new de Bruijn sequence constructions can be generated in O(n)-time per bit using O(n)-space. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1016/j.disc.2018.07.010 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Disjoint sets,Successor cardinal,Correctness,De Bruijn sequence,Mathematics | Journal | 341 |
Issue | ISSN | Citations |
11 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 15 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Daniel Gabric | 1 | 1 | 2.74 |
Joe Sawada | 2 | 66 | 9.11 |
Aaron Williams | 3 | 139 | 20.42 |
Dennis Wong | 4 | 22 | 3.80 |