On Pseudo-Random Arrays Constructed from Patterns with distinct Differences
A few constructions of infinite arrays such that, in each (2 n +n-1)×(2 n +1) subarray, each n×2 binary matrix appears exactly once, are given. In other constructions each n×2 binary nonzero matrix appears exactly once. The constructions are using patterns with distinct differences, and although the arrays are not linear they have some similar properties to m-sequences.
KeywordsPrimitive Element Random Array Binary Matrice Polygonal Path Perfect Sequence
Unable to display preview. Download preview PDF.
- S. W. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park Press, 1982.Google Scholar
- T. Etzion, “Constructions for Perfect Maps and Pseudo-Random Arrays”, IEEE Trans, on Inform. Theory, to appear.Google Scholar
- J. Denes and A. D. Keedwell, “A new construction of two-dimensional array with the window property”, submitted for publication.Google Scholar
- S. W. Golomb, T. Etzion, and H. Taylor, “Polygonal path constructions for Tuscan- k squares”,Ars Combinatoria, to appear.Google Scholar
- T. Etzion, “ On hamiltonian decomposition of K n*, patterns with distinct differences, and Tuscan squares”, submitted for publication.Google Scholar
- P. V. Kumar, “On the existence of square, dot-matrix patterns having a specific 3- valued periodic-correlation function”,IEEE Trans, on Information Theory, to appear.Google Scholar