De Bruijn sequences for the binary strings with maximum density

DOI10.1007/978-3-642-19094-0_19MaRDI QIDQ3078396zbMATH OpenOpenAlexFDO

Authors Joe Sawada, Brett Stevens, Aaron Williams

Publication date 20 February 2011

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19094-0_19

zbMATH Keywords

de Bruijn sequenceLyndon wordsnecklacesGray codescool-lex orderfixed-density de Bruijn sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• De Bruijn sequences for fixed-weight binary strings
• scientific article; zbMATH DE number 2192127
• scientific article; zbMATH DE number 2188425
• A generalized recursive construction for de Bruijn sequences
• ``Periods of de Bruijn sequences

Cites work

• scientific article; zbMATH DE number 3505007 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• An algorithm for generating necklaces of beads in two colors
• Binary bubble languages and cool-lex order
• Binary de Bruijn cycles under different equivalence relations
• De Bruijn sequences for fixed-weight binary strings
• Generating necklaces
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• On universal cycles for multisets
• The coolest way to generate combinations
• Universal cycles for combinatorial structures

Cited in

(11)

• Binary bubble languages and cool-lex order
• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Designing preference functions for de Bruijn sequences with forbidden words
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• De Bruijn sequences for fixed-weight binary strings
• The coolest way to generate binary strings
• Properties of the cycles that contain all vectors of weight \(\le k\)
• A surprisingly simple de Bruijn sequence construction
• A framework for constructing de Bruijn sequences via simple successor rules
• Minimum degree and density of binary sequences

This page was built for publication: De Bruijn sequences for the binary strings with maximum density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078396)