JUCS - Journal of Universal Computer Science 9(10): 1204-1219, doi: 10.3217/jucs-009-10-1204
On Identification in ZZ2 Using Translates of Given Patterns
expand article infoIiro Honkala‡, Antoine Lobstein§
‡ Department of Mathematics University of Turku, Finland§ CNRS and ENST, Paris, France

Corresponding author: Iiro Honkala ( honkala@utu.fi )

© Iiro Honkala, Antoine Lobstein.
This article is freely available under the J.UCS Open Content License.
Citation: Honkala I, Lobstein A (2003) On Identification in ZZ2 Using Translates of Given Patterns. JUCS - Journal of Universal Computer Science 9(10): 1204-1219. https://doi.org/10.3217/jucs-009-10-1204
Open Access
Abstract
Given a finite set of patterns, i.e., subsets of . What is the best way to place translates of them in such a way that every point belongs to at least one translate and no two points belong to the same set of translates? We give some general results, and investigate the particular case when there is only a single pattern and that pattern is a square or has size at most four.
Keywords
identifying code, square lattice, multiprocessor architecture