On identification in Z^2 using translates of given patterns

MaRDI QIDQ5429563zbMATH OpenFDO

Authors Iiro Honkala, Antoine Lobstein

Publication date 30 November 2007

Full work available at URL http://www.jucs.org/jucs_9_10/on_identification_in_zz2

zbMATH Keywords

identifying codemultiprocessor architecturesquare lattice

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60)

Recommendations

• Tiling \(\mathbb Z^2\) with translations of one set
• On the identification of sets of points in the square lattice
• Periodicity and decidability of tilings of \(\mathbb{Z}^2\)
• Tiling \(\mathbb{Z}^{2}\) by a set of four elements
• Patterns without a popular difference

Cited in

(7)

• Identifying and locating-dominating codes on chains and cycles
• Watching systems in the King grid
• Watching systems in graphs: an extension of identifying codes
• Locating-domination and identification
• Maximum size of a minimum watching system and the graphs achieving the bound
• Identification in \(\mathbb Z^2\) using Euclidean balls
• On Iiro Honkala's contributions to identifying codes

This page was built for publication: On identification in \(\mathbb Z^2\) using translates of given patterns

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