Skip to main content
Log in

New constructions for De Bruijn tori

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A De Bruijn torus is a periodicd-dimensionalk-ary array such that eachn 1 × ... ×n d k-ary array appears exactly once with the same period. We describe two new methods of constructing such arrays. The first is a type of product that constructs ak 1 k 2 -ary torus from ak 1 -ary torus and ak 2 -ary torus. The second uses a decomposition of ad-dimensional torus to produce ad+1 dimensional torus. Both constructions will produce two dimensionalk-ary tori for which the period is not a power ofk. In particular, for\(k = \Pi p_l^{\alpha _l }\) and for all natural numbers (n 1 , n 2 ), we construct 2-dimensionalk-ary De Bruijn tori with order 〈n 1 , n 2 〉 and period\(\langle q, k^{n_1 n_2 /q} \rangle\) where\(q = k\Pi p_l^{\left\lfloor {\log _{p_l } n_1 } \right\rfloor }\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. C. Cock, Toroidal tilings from De Bruijn-Good cyclic sequences,Discrete Math., Vol. 70 (1988) pp. 209–210.

    Google Scholar 

  2. T. Etzion, Constructions for perfect maps and pseudo-random arrays,IEEE Trans. Inform. Theory, Vol. IT-34 (1988) pp. 1308–1316.

    Google Scholar 

  3. C. T. Fan, S. M. Fan, S. L. Ma, and M. K. Siu, On De Bruijn arrays,Ars Combin., Vol. 19 (1985) pp. 205–213.

    Google Scholar 

  4. H. M. Fredricksen, A survey of full length nonlinear shift register cycle algorithms,SIAM Rev., Vol. 24 (1982) pp. 195–221.

    Google Scholar 

  5. G. Hurlbert and G. Isaak, On the De Bruijn torus problem,J. Combin. Theory Ser. A, Vol. 64 (1993) pp. 50–62.

    Google Scholar 

  6. G. Hurlbert and G. Isaak, A meshing technique for De Bruijn tori,Jerusalem Combinatorics Conference Proceedings, AMS contemporary mathematics series, to appear.

  7. S. L. Ma, A note on binary arrays with certain window properties,IEEE Trans. Inform. Theory, Vol. IT-30 (1984) pp. 774–775.

    Google Scholar 

  8. C. J. Mitchell and K. G. Paterson, Decoding Perfect Maps,Designs, Codes and Cryptography, Vol. 4 (1994) pp. 11–30.

    Google Scholar 

  9. K. G. Paterson, Perfect maps,IEEE Trans. Inform. Theory, to appear.

  10. K. G. Paterson, Perfect factors in the De Bruijn graph, manuscript, 1994.

  11. K. G. Paterson,New Classes of Perfect Maps II, manuscript, 1994.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to the memory of Tony Brewster

Partially supported by NSF grant DMS-9201467

Partially supported by a grant from the Reidler Foundation

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hurlbert, G., Isaak, G. New constructions for De Bruijn tori. Des Codes Crypt 6, 47–56 (1995). https://doi.org/10.1007/BF01390770

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01390770

Keywords

Navigation