Constructions for perfect maps and pseudorandom arrays

DOI10.1109/18.21260MaRDI QIDQ4735201zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Perfect maps
• New classes of perfect maps. I
• Infinite families of perfect binary arrays
• Decoding perfect maps
• Aperiodic and semi-periodic perfect maps

Cited in

(18)

• Perfect factors in the de Bruijn graph
• Locating patterns in the de Bruijn torus
• Constructing \(c\)-ary perfect factors
• One-shot M-array pattern based on coded structured light for three-dimensional object reconstruction
• Decoding perfect maps
• A state of the art in structured light patterns for surface profilometry
• scientific article; zbMATH DE number 6531818 (Why is no real title available?)
• Robust positioning patterns with low redundancy
• Graphs with the unique path property: Structure, cycles, factors, and constructions
• New constructions for De Bruijn tori
• Pattern codification strategies in structured light systems
• Construction of infinite de Bruijn arrays
• Existence of a folding in multidimensional coding
• Construction for M-arrays and application in structured light
• The combinatorics of binary arrays
• New classes of perfect maps. I
• New classes of perfect maps. II
• Perfect maps

This page was built for publication: Constructions for perfect maps and pseudorandom arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735201)