Identification in Z^2 using Euclidean balls

DOI10.1016/J.DAM.2010.12.008MaRDI QIDQ628317zbMATH OpenOpenAlexFDO

Authors Ville Junnila, Tero Laihonen

Publication date 10 March 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.12.008

zbMATH Keywords

Euclidean distancefault diagnosisidentifying codeoptimal codesensor network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tolerant identification with Euclidean balls
• Locating sensors in paths and cycles: the case of 2-identifying codes
• A family of optimal identifying codes in \(\mathbb Z^2\)
• On identifying codes
• Codes for identification in the king lattice

Cites work

• Adaptive identification in graphs
• Codes for identification in the king lattice
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Fault-tolerant locating-dominating sets
• General bounds for identifying codes in some infinite regular graphs
• Identifying and locating-dominating codes on chains and cycles
• Identifying Codes and Covering Problems
• On a new class of codes for identifying vertices in graphs
• On a new class of identifying codes in graphs
• On codes identifying sets of vertices in Hamming spaces
• On identification in \(\mathbb Z^2\) using translates of given patterns
• On Identifying Codes in the Triangular and Square Grids
• On robust and dynamic identifying codes
• On the density of identifying codes in the square lattice
• On the identification of sets of points in the square lattice
• The minimum density of an identifying code in the king lattice.

Cited in

(5)

• Identification of points using disks
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Tolerant identification with Euclidean balls
• On Iiro Honkala's contributions to identifying codes

This page was built for publication: Identification in \(\mathbb Z^2\) using Euclidean balls

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