On identifying codes that are robust against edge changes

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60) Fault detection; testing in circuits and networks (94C12)

Recommendations

On identifying codes in the King grid that are robust against edge deletions
scientific article; zbMATH DE number 5228468
A family of optimal identifying codes in $\mathbb Z^2$
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
An optimal edge-robust identifying code in the triangular lattice

Cites work

A coloring problem in Hamming spaces
A family of optimal identifying codes in $\mathbb Z^2$
An optimal edge-robust identifying code in the triangular lattice
An optimal locating-dominating set in the infinite triangular grid
Bounds for codes identifying vertices in the hexagonal grid
Codes for identification in the king lattice
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
Families of optimal codes for strong identification
Fault-tolerant locating-dominating sets
General bounds for identifying codes in some infinite regular graphs
scientific article; zbMATH DE number 3906528 (Why is no real title available?)
scientific article; zbMATH DE number 4070954 (Why is no real title available?)
scientific article; zbMATH DE number 1024657 (Why is no real title available?)
scientific article; zbMATH DE number 1095171 (Why is no real title available?)
scientific article; zbMATH DE number 861343 (Why is no real title available?)
scientific article; zbMATH DE number 5228468 (Why is no real title available?)
Identifying and locating-dominating codes on chains and cycles
Identifying codes with small radius in some infinite regular graphs
On 2-edge robust $r$-identifying codes in the king grid
On a new class of codes for identifying vertices in graphs
On codes identifying vertices in the two-dimensional square lattice with diagonals
On identifying codes in binary Hamming spaces
On identifying codes in the hexagonal mesh
On identifying codes in the King grid that are robust against edge deletions
On Identifying Codes in the Triangular and Square Grids
On locating--dominating sets in infinite grids
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
On robust and dynamic identifying codes
On robust identification in the square and King grids
On strongly identifying codes
On the structure of linear codes with covering radius two and three
On vertex-robust identifying codes of level three.
Optimal $t$-edge-robust $r$-identifying codes in the king lattice
Optimal codes for strong identification
Sequences of optimal identifying codes
Unit sphere packings and coverings of the Hamming space

Cited in

(12)

On identifying codes in the King grid that are robust against edge deletions
An optimal edge-robust identifying code in the triangular lattice
Minimum sizes of identifying codes in graphs differing by one edge
Tolerant location detection in sensor networks
Minimum sizes of identifying codes in graphs differing by one vertex
Edge identifying codes
Locating-domination and identification
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
Tolerant identification with Euclidean balls
scientific article; zbMATH DE number 5228468 (Why is no real title available?)
On Iiro Honkala's contributions to identifying codes
Fault tolerant detectors for distinguishing sets in graphs

This page was built for publication: On identifying codes that are robust against edge changes

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