Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain factors in the de Bruijn graph. These factors are called zero factors and perfect factors in the de Bruijn graph. We apply a folding technique to construct pseudo-random array codes and examine the minimum distance of the constructed codes. The folding is applied on sequences generated from irreducible polynomials or a product of irreducible polynomials with the same degree and the same exponent. Direct and recursive constructions for de Bruijn array codes are presented and discussed.

翻译：伪随机阵列和完美映射分别是M序列和德布鲁因序列的二维模拟。我们对相关定义进行修正，使其适用于编码领域。这些编码亦是德布鲁因图中特定因子的二维对应物，这些因子在德布鲁因图中被称为零因子和完美因子。我们采用折叠技术构造伪随机阵列码，并检验所构造码的最小距离。该折叠技术应用于由不可约多项式或具有相同次数和相同指数的不可约多项式之积生成的序列。文中提出并讨论了德布鲁因阵列码的直接构造法与递归构造法。