Constructions for perfect maps and pseudorandom arrays

A construction of perfect maps, i.e. periodic r*v binary arrays in which each n*m binary matrix appears exactly once, is given. A similar construction leads to arrays in which only the zero n*m matrix does not appear and to a construction in which only a few n*m binary matrices do not appear. A generalization to the nonbinary case is given. The constructions involve an interesting problem in shift-register theory. The solution is given for almost all the case of this problem. >

[1]  Irving S. Reed,et al.  Note on the existence of perfect maps , 1962, IRE Trans. Inf. Theory.

[2]  Harold Fredricksen,et al.  A Class of Nonlinear de Bruijn Cycles , 1975, J. Comb. Theory, Ser. A.

[3]  B. Gordon.  On the existence of perfect maps (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[4]  Harold Fredricksen,et al.  Necklaces of beads in k colors and k-ary de Bruijn sequences , 1978, Discret. Math..

[5]  Abraham Lempel,et al.  On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.

[6]  Tuvi Etzion.  An Algorithm for Constructing m-ary de Bruijn Sequences , 1986, J. Algorithms.

[7]  F. MacWilliams,et al.  Pseudo-random sequences and arrays , 1976, Proceedings of the IEEE.

[8]  Svein Mossige.  Table of irreducible polynomials over [2] of degrees 10 through 20 , 1972 .

[9]  Anthony Ralston.  A New Memoryless Algorithm for De Bruijn Sequences , 1981, J. Algorithms.

[10]  Siu Lun Ma.  A note on binary arrays with a certain window property , 1984, IEEE Trans. Inf. Theory.

[11]  de Ng Dick Bruijn,et al.  Circuits and Trees in Oriented Linear Graphs , 1951 .

[12]  Akira Fukuda,et al.  A theory of two-dimensional linear recurring arrays , 1972, IEEE Trans. Inf. Theory.

[13]  F. MacWilliams,et al.  On pseudo-random arrays , 1979 .

[14]  B. Elspas,et al.  The Theory of Autonomous Linear Sequential Networks , 1959 .

[15]  Tuvi Etzion,et al.  Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.

[16]  Tuvi Etzion,et al.  Algorithms for the generation of full-length shift-register sequences , 1984, IEEE Trans. Inf. Theory.

[17]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[18]  Richard A. Games,et al.  On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.

[19]  H. Fredricksen.  A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .