On de Bruijn Array Codes—Part I: Nonlinear Codes

Abstract

A de Bruijn array code is a set of $r \times s$ binary doubly-periodic arrays such that each binary $n \times m$ matrix is contained exactly once as a window in one of the arrays. Such a set of arrays can be viewed as a two-dimensional generalization of a perfect factor in the de Bruijn graph. Necessary conditions for the existence of such codes are proved. Several direct constructions and recursive constructions for such arrays are presented. A framework for a theory of two-dimensional feedback shift registers which is akin to (one-dimensional) feedback shift registers is suggested in the process.