On the de Bruijn torus problem

DOI10.1016/0097-3165(93)90087-OMaRDI QIDQ690027zbMATH OpenOpenAlexWikidataFDO

Authors 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

de Bruijn cyclede Bruijn torusmatrixsequencetoroidal array

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Recommendations

• scientific article; zbMATH DE number 4072975
• New constructions for De Bruijn tori
• Problems related to a de Bruijn-Erdös theorem
• Locating patterns in the de Bruijn torus
• scientific article; zbMATH DE number 718858
• scientific article; zbMATH DE number 609926
• The Collatz conjecture and de Bruijn graphs
• On the connectivity of the De Bruijn graph
• On the existence of de Bruijn tori with two by two windows
• scientific article; zbMATH DE number 6900646

Cites work

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

Cited in

(21)

• Toroidal tilings from de Bruijn-Good cyclic sequences
• Perfect factors in the de Bruijn graph
• The combinatorics of binary arrays
• Computing generalized de Bruijn sequences
• New constructions for De Bruijn tori
• New classes of perfect maps. I
• Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
• scientific article; zbMATH DE number 3908332 (Why is no real title available?)
• scientific article; zbMATH DE number 718858 (Why is no real title available?)
• The coolest way to generate binary strings
• scientific article; zbMATH DE number 1409192 (Why is no real title available?)
• On a construction of easily decodable sub-de Bruijn arrays
• Contributions to the theory of de Bruijn cycle
• The k-centre problem for classes of cyclic words
• Using alternating de Bruijn sequences to construct de Bruijn tori
• Robot positioning using torus packing for multisets
• Universal partial tori
• On de Bruijn rings and families of almost perfect maps
• Yamatárájabhánasalagám (the rhythm of de Bruijn's successions)
• Locating patterns in the de Bruijn torus
• Growing perfect cubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690027)