On robust identification in the square and King grids
type: Item
instance of: scholarly article
title: On robust identification in the square and King grids
zbMATH Open document ID: 1104.93019
author: Tero Laihonen
published in: Discrete Applied Mathematics
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 93B30
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 5083155
zbMATH Keywords: multiprocessor system
zbMATH Keywords: fault diagnosis
zbMATH Keywords: robust identification
zbMATH Keywords: optimal code
MaRDI profile type: Publication
full work available at URL: j.dam.2006.03.037
OpenAlex ID: W2069819456
cites work: Exact Minimum Density of Codes Identifying Vertices in the Square Grid
cites work: Bounds on identifying codes
cites work: General bounds for identifying codes in some infinite regular graphs
cites work: The minimum density of an identifying code in the king lattice.
cites work: Identifying codes with small radius in some infinite regular graphs
cites work: New bounds for codes identifying vertices in graphs
cites work: Bounds for codes identifying vertices in the hexagonal grid
cites work: On codes identifying vertices in the two-dimensional square lattice with diagonals
cites work: On identifying codes
cites work: An optimal edge-robust identifying code in the triangular lattice
cites work: On robust and dynamic identifying codes
cites work: On the identification of sets of points in the square lattice
cites work: Codes for identification in the king lattice
cites work: On Identifying Codes in the Triangular and Square Grids
cites work: On identifying codes in the hexagonal mesh
cites work: On a new class of identifying codes in graphs
cites work: On identification in the triangular grid
cites work: On the density of identifying codes in the square lattice
cites work: On a new class of codes for identifying vertices in graphs
cites work: Sequences of optimal identifying codes
cites work: Optimal codes for strong identification
cites work: Q5437393
cites work: On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
DOI: 10.1016/J.DAM.2006.03.037
description: scientific article; zbMATH DE number 5083155