Pages that link to "Item:Q3912587"

The following pages link to A new memoryless algorithm for de Bruijn sequences (Q3912587):

Displaying 7 items.

• A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
• A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
• A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
• Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
• Test sequence construction using minimum information on the tested system (Q2498283) (← links)
• Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)