Pages that link to "Item:Q2081554"
From MaRDI portal
The following pages link to On greedy algorithms for binary de Bruijn sequences (Q2081554):
Displaying 8 items.
- On finding minimal, maximal, and consistent sequences over a binary alphabet (Q673107) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Mapping prefer-opposite to prefer-one de Bruijn sequences (Q1675290) (← links)
- Storage efficient decoding for a class of binary de Bruijn sequences (Q1842178) (← links)
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions (Q2220830) (← links)
- A relation between sequences generated by Golomb's preference algorithm (Q2678989) (← links)
- On Greedy Algorithms for Binary de Bruijn Sequences (Q6314496) (← links)
- On prefer-one sequences (Q6618624) (← links)