On identification in Z(2) using translates of given patterns



: Honkala I, Lobstein A

Publisher: GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM

: 2003

: Journal of Universal Computer Science

: JOURNAL OF UNIVERSAL COMPUTER SCIENCE

: J UNIVERS COMPUT SCI

: 9

: 10

: 1204

: 1219

: 16

: 0948-695X


Given a finite set of patterns, i.e., subsets of Z(2). 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.



Last updated on 2024-26-11 at 20:19