IJPAM: Volume 36, No. 1 (2007)

ON EDGE-ROBUST $(1,\leq l)$-IDENTIFYING
CODES IN BINARY HAMMING SPACES

Tero Laihonen
Department of Mathematics
University of Turku
Turku, 20014, FINLAND
e-mail: terolai@utu.fi


Abstract.The motivation for identifying codes comes, for instance, from fault diagnosis in multiprocessor systems. Another application is emergency sensor networks. In this paper we consider $t$-edge-robust $(1,\leq l)$-identifying codes, that is, identifying codes that remain identifying even if the underlying structure changes due to some failures. In particular, we give a classification of 1-edge-robust $(1,\leq 2)$-identifying codes in binary Hamming spaces. Using this we obtain an infinite family of optimal 1-edge-robust $(1,\leq 2)$-identifying codes.

Received: February 15, 2007

AMS Subject Classification: 94C12, 94B65, 05C70

Key Words and Phrases: identifying code, robustness, optimal code, Hamming space

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2007
Volume: 36
Issue: 1