On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
Tero K Laihonen · SIAM Journal on Discrete Mathematics · 2005
The motivation for identifying codes comes from maintenance of multiprocessor architectures. In this paper, we give infinite families of optimal edge-robust identifying codes and vertex-robust identifying codes in binary Hamming spaces.