The lexicographically smallest universal cycle for binary strings with minimum specified weight
From MaRDI portal
Publication:405571
DOI10.1016/J.JDA.2014.06.003zbMATH Open1306.68212OpenAlexW2066342920MaRDI QIDQ405571FDOQ405571
Joe Sawada, Aaron Williams, Dennis Wong
Publication date: 5 September 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.06.003
Recommendations
- Universal Cycles for Weight-Range Binary Strings
- De Bruijn sequences for fixed-weight binary strings
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Universal cycles for weak orders
- On universal cycles for new classes of combinatorial structures
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Title not available (Why is that?)
- Title not available (Why is that?)
- A problem in arrangements
- Normal Recurring Decimals
- Universal cycles for combinatorial structures
- On universal cycles of labeled graphs
- On Universal Cycles for k-Subsets of an n-Set
- Universal cycles of \(k\)-subsets and \(k\)-permutations
- An algorithm for generating necklaces of beads in two colors
- De Bruijn sequences for fixed-weight binary strings
- Generating necklaces
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Universal cycles for permutations
- Minimum Eulerian circuits and minimum de Bruijn sequences
- Shorthand universal cycles for permutations
- Binary de Bruijn cycles under different equivalence relations
- Universal Cycles for Weight-Range Binary Strings
- An explicit universal cycle for the ( n -1)-permutations of an n -set
- De Bruijn Sequences for the Binary Strings with Maximum Density
- Universal Cycles of Discrete Functions
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Universal cycles of classes of restricted words
Cited In (7)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Constructing de Bruijn sequences by concatenating smaller universal cycles
- Universal Cycles for Weight-Range Binary Strings
- Properties of the cycles that contain all vectors of weight \(\le k\)
- Investigating the discrepancy property of de Bruijn sequences
This page was built for publication: The lexicographically smallest universal cycle for binary strings with minimum specified weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405571)
