On Pseudo-Random Arrays Constructed from Patterns with distinct Differences

Tuvi Etzion
Additional contact information
Tuvi Etzion: Computer Science Department, Technion

A chapter in Sequences, 1990, pp 195-207 from Springer

Abstract: Abstract 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.

Keywords: Primitive Element; Random Array; Binary Matrice; Polygonal Path; Perfect Sequence (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_15

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().