Pages that link to "Item:Q405571"
From MaRDI portal
The following pages link to The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571):
Displaying 6 items.
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) (← links)
