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
Tolerant identification with Euclidean balls, Identification in \(\mathbb Z^2\) using Euclidean balls, 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, Improved bounds on identifying codes in binary Hamming spaces, On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results, Extremal cubic graphs for fault-tolerant locating domination, Tolerant location detection in sensor networks, On identifying codes that are robust against edge changes, An optimal locating-dominating set in the infinite triangular grid, Liar's domination, Locating-Domination and Identification, Identifying and Locating–Dominating Codes in (Random) Geometric Networks