The coolest way to generate binary strings

DOI10.1007/S00224-013-9486-8MaRDI QIDQ489746zbMATHOpenAlexFDO

Authors Brett Stevens, Aaron Williams

Publication date 21 January 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-013-9486-8

zbMATH Keywords

de Bruijn sequenceHamming distancecombinatorics on wordsGray codebinary stringscool-lex orderFKM algorithmuniversal cycleLevenshtein distancenecklace prefix algorithm

Mathematics Subject Classification ID

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

Recommendations

• Computing on binary strings
• scientific article; zbMATH DE number 1472198
• Efficient generation of binary words of given weight
• On generating binary words palindromically
• Counting certain binary strings
• Binary strings and the Jacobsthal numbers
• Binary strings with all runs of odd length
• scientific article; zbMATH DE number 1665457
• Generative binary codes

Cites work

• scientific article; zbMATH DE number 7051269 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• scientific article; zbMATH DE number 4195954 (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
• A problem in arrangements
• Adjacent interchange generation of combinations
• An algorithm for generating necklaces of beads in two colors
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Binary bubble languages and cool-lex order
• Cool-lex order and \(k\)-ary Catalan structures
• De Bruijn sequences for fixed-weight binary strings
• De Bruijn sequences for the binary strings with maximum density
• Efficient oracles for generating binary bubble languages
• Generating necklaces
• Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
• Long cycles in the middle two layers of the discrete cube
• Monotone Gray codes and the middle levels problem
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• On the de Bruijn torus problem
• The coolest way to generate combinations
• The origins of combinatorics on words

Cited in

(10)

• On universal partial words
• Trimming and gluing Gray codes
• Successor rules for flipping pancakes and burnt pancakes
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• On the hardness of Gray code problems for combinatorial objects
• Computing generalized de Bruijn sequences
• Flip-swap languages in binary reflected Gray code order
• De Bruijn sequences for fixed-weight binary strings
• The coolest way to generate combinations
• Binary bubble languages and cool-lex order

This page was built for publication: The coolest way to generate binary strings

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