Pages that link to "Item:Q2550021"
From MaRDI portal
The following pages link to Generation of the Ford sequence of length \(2^ n\), n large (Q2550021):
Displaying 12 items.
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- Longest subsequences shared by two de Bruijn sequences (Q780381) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Lexicographic compositions and de Bruijn sequences (Q1232525) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← 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)
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions (Q2220830) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
