Constructions for perfect maps and pseudorandom arrays

DOI10.1109/18.21260zbMath0685.05011OpenAlexW2132137484MaRDI QIDQ4735201

Tuvi Etzion

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4c90f024b194f90f6b5a61318000f60f387afa92

zbMATH Keywords

binary arraysperfect maps

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items

Constructing \(c\)-ary perfect factors ⋮ One-shot M-array pattern based on coded structured light for three-dimensional object reconstruction ⋮ Pattern codification strategies in structured light systems ⋮ Perfect factors in the de Bruijn graph ⋮ New constructions for De Bruijn tori ⋮ New classes of perfect maps. I ⋮ New classes of perfect maps. II ⋮ The combinatorics of binary arrays ⋮ Construction of infinite de Bruijn arrays ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Locating patterns in the de Bruijn torus ⋮ Existence of a folding in multidimensional coding ⋮ A state of the art in structured light patterns for surface profilometry ⋮ Robust Positioning Patterns with Low Redundancy ⋮ Construction for M-arrays and application in structured light ⋮ Decoding perfect maps