109

urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891

JUCS - Journal of Universal Computer Science

jucs

0948-695X 0948-6968

Journal of Universal Computer Science

10.3217/jucs-009-10-1204

28120

Research Article

E.4 - CODING AND INFORMATION THEORY

On Identification in ZZ2 Using Translates of Given Patterns

Honkala

Iiro

honkala@utu.fi 1 Lobstein

Antoine

Department of Mathematics University of Turku, , Finland

Department of Mathematics University of Turku Finland 2

CNRS and ENST, Paris, France

CNRS and ENST

Paris

France

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

Academic editor:

2003

28 10 2003

9 10 1204 1219 EB84FE09-4938-5334-87E6-EACC037F8FD5 6996422

Iiro Honkala, Antoine Lobstein

This article is freely available under the J.UCS Open Content License.

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.