Universal Cycles for Weight-Range Binary Strings
From MaRDI portal
Recommendations
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Counting cyclic binary strings
- The Structure and Properties of Binary Cyclic Alphabets
- scientific article; zbMATH DE number 3266248
- scientific article; zbMATH DE number 166128
- Universal cycles of classes of restricted words
- De Bruijn sequences for fixed-weight binary strings
- Universal cycles for permutations
- scientific article; zbMATH DE number 1594298
Cited in
(15)- Constructing de Bruijn sequences by concatenating smaller universal cycles
- A framework for constructing de Bruijn sequences via simple successor rules
- Investigating the discrepancy property of de Bruijn sequences
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Properties of the cycles that contain all vectors of weight k
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- A surprisingly simple de Bruijn sequence construction
- scientific article; zbMATH DE number 3266248 (Why is no real title available?)
- Constructing the first (and coolest) fixed-content universal cycle
- Cut-down de Bruijn sequences
- Constructing k-ary orientable sequences with asymptotically optimal length
- Efficient methods of constructing universal cycles for k-permutations
- Efficient methods of constructing shorthand universal cycles for permutations
- Universal cycle constructions for k-subsets and k-multisets
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
This page was built for publication: Universal Cycles for Weight-Range Binary Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870044)
