Codes for identification in the king lattice
From MaRDI portal
Publication:1423495
DOI10.1007/s00373-003-0531-2zbMath1037.05019OpenAlexW1971592384MaRDI QIDQ1423495
Tero Laihonen, Iiro S. Honkala
Publication date: 4 March 2004
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-003-0531-2
Applications of graph theory (05C90) Bounds on codes (94B65) Distance in graphs (05C12) Combinatorial codes (94B25)
Related Items
On identifying codes that are robust against edge changes ⋮ Watching systems in the King grid ⋮ On a new class of identifying codes in graphs ⋮ New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid ⋮ On robust identification in the square and King grids ⋮ Tolerant identification with Euclidean balls ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid ⋮ Optimal identifying codes in the infinite 3-dimensional king grid ⋮ On the identification problems in products of cycles ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ On identifying codes in the hexagonal mesh ⋮ On identification in the triangular grid
