Constructions for perfect maps and pseudorandom arrays

@article{Etzion1988ConstructionsFP,
  title={Constructions for perfect maps and pseudorandom arrays},
  author={Tuvi Etzion},
  journal={IEEE Trans. Information Theory},
  year={1988},
  volume={34},
  pages={1308-1316}
}
A construction of perfect maps, Le., periodic r X u binary arrays in which each n X m binary matrix appears exactly once, is given. A similar construction leads to arrays in which only the zero n X m matrix does not appear and to a construction in which only a few n X m binary matrices do not appear. A generalization to the nonbinary case is also given. The constructions involve an interesting problem in shift register theory. We give the solution for almost all the cases of this problem. 
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
50 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

99 Citations

01020'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On the existence of perfect maps,

  • B. Gordon
  • arrays,” Ars Combinatoria,
  • 1985

Algorithms for the generation of full - length shftregister sequences

  • A. H. Chan
  • IEEE Trans . Inform . Theory
  • 1984

On de Bruijn arrays

  • S. M. Fan, S. L. Ma, M. K. Siu
  • Ars Combinatoria
  • 1984

A survey of full length nonlinear shift register cycle algorithms,

  • H. M. Fredricksen
  • SIAM Reu.,
  • 1982

N

  • Feb.
  • G. de Bruijn, “A combinatorial problem,” Nederl…
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…