An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero sequences have the same period. These polynomials generate \emph{sets} of sequences with properties similar to M-sequences. In this paper, a two-dimensional generalization for such sequences is given. This generalization is for a pseudo-random array code, which is a set of $r_1 \times r_2$ arrays in which each $n_1 \times n_2$ nonzero matrix is contained exactly once as a window in one of the arrays. Moreover, these arrays have the shift-and-add property, i.e., the bitwise addition of two arrays (or a nontrivial shift of such arrays) is another array (or a shift of another array) from the code. All the known arrays can be formed by folding sequences generated from an irreducible polynomial or a reducible polynomial whose factors have the same degree and the same exponent. Two proof techniques are used to prove the constructions are indeed of pseudo-random array codes. The first technique is based on another method, different from folding, for constructing some of these arrays. The second technique is a generalization of a known proof technique. This generalization enables the construction of pseudo-random arrays with parameters not known before, and also provides a variety of pseudo-random array codes which cannot be generated by the first method. The two techniques also suggest two different hierarchies between pseudo-random array codes. Finally, two methods to verify whether a folding of sequences, generated by these polynomials, yields a pseudo-random array or a pseudo-random array code, will be presented.