On identifying codes that are robust against edge changes
From MaRDI portal
Publication:2373878
DOI10.1016/j.ic.2007.01.003zbMath1122.68085MaRDI QIDQ2373878
Tero Laihonen, Iiro S. Honkala
Publication date: 16 July 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.01.003
robustness; fault tolerance; optimal code; undirected graph; identifying code; multiprocessor system; edge changes
68R10: Graph theory (including graph drawing) in computer science
94C12: Fault detection; testing in circuits and networks
94B60: Other types of codes
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Tolerant identification with Euclidean balls, Fault tolerant detectors for distinguishing sets in graphs, 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, Locating-Domination and Identification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On identifying codes in binary Hamming spaces
- On locating--dominating sets in infinite grids
- A family of optimal identifying codes in \(\mathbb Z^2\)
- On robust identification in the square and King grids
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- On identifying codes in the King grid that are robust against edge deletions
- On identifying codes in the hexagonal mesh
- A coloring problem in Hamming spaces
- Codes for identification in the king lattice
- Fault-tolerant locating-dominating sets
- Optimal codes for strong identification
- Families of optimal codes for strong identification
- On strongly identifying codes
- Unit sphere packings and coverings of the Hamming space
- Identifying and locating-dominating codes on chains and cycles
- 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
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On robust and dynamic identifying codes
- On the structure of linear codes with covering radius two and three
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- On Identifying Codes in the Triangular and Square Grids
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
