On two variations of identifying codes

Olivier Delmas (1) , Sylvain Gravier (2) , Mickael Montassier (1) , Aline Parreau (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 IF - Institut Fourier

Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and light codes. They correspond to fault-detection by successive rounds. We give exact bounds for those two definitions for the family of cycles.

Mots clés: identifying codes; cycles; metric basis

Domaines: Mathématique discrète [cs.DM]; Théorie de l'information [cs.IT]; Combinatoire [math.CO]; Théorie de l'information et codage [math.IT]; Recherche opérationnelle [math.OC]

Olivier Delmas, Sylvain Gravier, Mickael Montassier, Aline Parreau. On two variations of identifying codes. Discrete Mathematics, 2011, 311 (17), pp.1948-1956. ⟨10.1016/j.disc.2011.05.018⟩. ⟨hal-00475625v2⟩