On the de Bruijn torus problem

DOI10.1016/0097-3165(93)90087-OzbMath0780.05010OpenAlexW2061453733WikidataQ56706382 ScholiaQ56706382MaRDI QIDQ690027

Garth Isaak, Glenn H. Hurlbert

Publication date: 2 December 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(93)90087-o

zbMATH Keywords

matrixsequencede Bruijn cyclede Bruijn torustoroidal array

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (9)

Perfect factors in the de Bruijn graph ⋮ New constructions for De Bruijn tori ⋮ New classes of perfect maps. I ⋮ The combinatorics of binary arrays ⋮ Computing generalized de Bruijn sequences ⋮ The k-centre problem for classes of cyclic words ⋮ The coolest way to generate binary strings ⋮ Growing perfect cubes ⋮ On a Construction of Easily Decodable Sub-de Bruijn Arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toroidal tilings from de Bruijn-Good cyclic sequences
• Universal cycles for combinatorial structures
• A class of nonlinear de Bruijn cycles
• Lexicographic compositions and de Bruijn sequences
• Generation of the Ford sequence of length \(2^ n\), n large
• A note on binary arrays with a certain window property (Corresp.)
• Satins and Twills: An Introduction to the Geometry of Fabrics
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On Pseudo-Random Arrays
• The lexicographically least de Bruijn cycle
• Normal Recurring Decimals

This page was built for publication: On the de Bruijn torus problem