A framework for constructing de Bruijn sequences via simple successor rules

DOI10.1016/j.disc.2018.07.010zbMath1395.05003OpenAlexW2885945836MaRDI QIDQ1783608

Daniel Gabric, Aaron Williams, Joe Sawada, Dennis Wong

Publication date: 21 September 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.07.010

zbMATH Keywords

Bruijn sequence constructionscycling register

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithms on strings (68W32)

Related Items (8)

A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Two-way machines and de Bruijn words ⋮ Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ Efficient universal cycle constructions for weak orders ⋮ Sparse Kneser graphs are Hamiltonian

Cites Work

• Unnamed Item
• Spans of preference functions for de Bruijn sequences
• A surprisingly simple de Bruijn sequence construction
• An algorithm for generating necklaces of beads in two colors
• Lexicographically least circular substrings
• Lexicographic compositions and de Bruijn sequences
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Self-dual sequences
• On the cycles and adjacencies in the complementary circulating register
• Generation of the Ford sequence of length \(2^ n\), n large
• The Grandmama de Bruijn Sequence for Binary Strings
• Universal Cycles for Weight-Range Binary Strings
• A Class of de Bruijn Sequences
• A Simple Combinatorial Algorithm for de Bruijn Sequences
• De Bruijn Sequences for the Binary Strings with Maximum Density
• Algorithms for the generation of full-length shift- register sequences
• An efficient algorithm for the generation of DeBruijn cycles
• A new algorithm for the generation of binary de Bruijn sequences
• A new memoryless algorithm for de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A problem in arrangements

This page was built for publication: A framework for constructing de Bruijn sequences via simple successor rules