The following pages link to On the de Bruijn torus problem (Q690027):
Displaying 12 items.
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- Locating patterns in the de Bruijn torus (Q906472) (← links)
- Growing perfect cubes (Q941376) (← links)
- Toroidal tilings from de Bruijn-Good cyclic sequences (Q1106852) (← links)
- Perfect factors in the de Bruijn graph (Q1345135) (← links)
- The combinatorics of binary arrays (Q1365504) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- New constructions for De Bruijn tori (Q1894269) (← links)
- New classes of perfect maps. I (Q1906142) (← links)
- On a Construction of Easily Decodable Sub-de Bruijn Arrays (Q4973253) (← links)
- Contributions to the theory of de Bruijn cycles (Q5262055) (← links)
