On Identification in ZZ2 Using Translates of Given Patterns

dc.creatorHonkala,Iiro
dc.creatorLobstein,Antoine
dc.date2003
dc.date.accessioned2024-02-06T12:52:36Z
dc.date.available2024-02-06T12:52:36Z
dc.descriptionGiven 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-009-10-1204
dc.identifierhttps://lib.jucs.org/article/28120/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8422
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 9(10): 1204-1219
dc.subjectidentifying code
dc.subjectsquare lattice
dc.subjectmultiprocessor architecture
dc.titleOn Identification in ZZ2 Using Translates of Given Patterns
dc.typeResearch Article
Файлы