Pages that link to "Item:Q501039"
From MaRDI portal
The following pages link to A surprisingly simple de Bruijn sequence construction (Q501039):
Displaying 14 items.
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- An interleaved method for constructing de Bruijn sequences (Q1720333) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- An efficiently generated family of binary de Bruijn sequences (Q2022156) (← links)
- On the \(k\)-error linear complexities of De Bruijn sequences (Q2057161) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- On greedy algorithms for binary de Bruijn sequences (Q2081554) (← links)
- A new upper bound on the order of affine sub-families of NFSRs (Q2179656) (← links)
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Cut-down de Bruijn sequences (Q6635080) (← links)
