A surprisingly simple de Bruijn sequence construction
From MaRDI portal
Publication:501039
DOI10.1016/J.DISC.2015.08.002zbMATH Open1322.05013OpenAlexW1745342855MaRDI QIDQ501039FDOQ501039
Authors: Joe Sawada, Aaron Williams, Dennis Wong 
Publication date: 8 October 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.08.002
Recommendations
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register
- A simple shift rule for \(k\)-ary de Bruijn sequences
- A simple combinatorial algorithm for de Bruijn sequences
- A framework for constructing de Bruijn sequences via simple successor rules
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
de Bruijn sequencenecklacesuniversal cycleCAT algorithmgenerateshift gray codeshift rulesuccessor rule
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Title not available (Why is that?)
- A problem in arrangements
- Lexicographically least circular substrings
- A class of nonlinear de Bruijn cycles
- Algorithms for the generation of full-length shift- register sequences
- Lexicographic compositions and de Bruijn sequences
- Universal Cycles for Weight-Range Binary Strings
- De Bruijn sequences for the binary strings with maximum density
- A simple combinatorial algorithm for de Bruijn sequences
- Generation of the Ford sequence of length \(2^ n\), n large
- A new algorithm for the generation of binary de Bruijn sequences
- A new memoryless algorithm for de Bruijn sequences
Cited In (20)
- Quantum algorithm for lexicographically minimal string rotation
- An efficient shift rule for the prefer-max de Bruijn sequence
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- On greedy algorithms for binary de Bruijn sequences
- An efficiently generated family of binary de Bruijn sequences
- A simple shift rule for \(k\)-ary de Bruijn sequences
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- The grandmama de Bruijn sequence for binary strings
- Successor rules for flipping pancakes and burnt pancakes
- A simple combinatorial algorithm for de Bruijn sequences
- Constructing de Bruijn sequences by concatenating smaller universal cycles
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register
- Two-way machines and de Bruijn words
- De Bruijn sequences for fixed-weight binary strings
- Cut-down de Bruijn sequences
- On the \(k\)-error linear complexities of De Bruijn sequences
- A new upper bound on the order of affine sub-families of NFSRs
- Investigating the discrepancy property of de Bruijn sequences
- A framework for constructing de Bruijn sequences via simple successor rules
- An interleaved method for constructing de Bruijn sequences
This page was built for publication: A surprisingly simple de Bruijn sequence construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501039)
