Abstract. We show how to construct an array of integers 0,…,c-1, on a torus, so that it contains all possible mxn blocks of such integers. The constructed array ...
Toroidal tilings from de Bruijn-Good cyclic sequences · John C. Cock · Published in Discrete Mathematics 1988 · Mathematics.
Gur construction generalizes to d-dimensional arrays, using @ de Bruijn-Good cyclic sequences, and shifting cyclically in up to d-1 dimensions. E.g. it can be.
Bibliographic details on Toroidal tilings from de Bruijn-Good cyclic sequences.
Dec 5, 2024 · A well-known method to generate de Bruijn sequences is the construction of an Eulerian cycle or of a Hamiltonian cycle in a de Bruijn digraph [ ...
3. J.C. Cock, Toroidal tilings from de Bruijn-Good Cyclic Sequences, Disc. Math. 70 (1988),. 209-210.
Jan 5, 2010 · Given one generalized de Bruijn torus, how many others share its multiplicities of rectangular subarrays (equivalently, its generalized de ...
Missing: Toroidal Good
... Toroidal tilings from de Bruijn-Good cyclic sequences. The algorithm is a bit technical, but at the end we obtain: deBruijn2D[symbols_, l_, w_] := Module ...
The intuitive generalization of the cyclic De Bruijn sequence to two dimensions requires the notion of a matrix shaped like a torus. We will call such an object.
Missing: Good | Show results with:Good
A cyclic sequence a is a k-ary equivalence-class de Bruijn cycle of ... J. C. COCK, Toroidal tilings from de Bruijn-Good cyclic sequences, Discrete Math.