On robust and dynamic identifying codes
From MaRDI portal
Publication:3547044
DOI10.1109/TIT.2005.862097zbMath1272.94093MaRDI QIDQ3547044
Lev B. Levitin, Mark G. Karpovsky, Iiro S. Honkala
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (15)
On locating--dominating sets in infinite grids ⋮ On identifying codes that are robust against edge changes ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ A family of optimal identifying codes in \(\mathbb Z^2\) ⋮ On robust identification in the square and King grids ⋮ Tolerant identification with Euclidean balls ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ Identifying and Locating–Dominating Codes in (Random) Geometric Networks ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ Liar's domination ⋮ Tolerant location detection in sensor networks ⋮ Locating-Domination and Identification
This page was built for publication: On robust and dynamic identifying codes
