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. © 2011 Elsevier B.V. All rights reserved.
Delmas, O., Gravier, S., Montassier, M., & Parreau, A. (2011). On two variations of identifying codes. Discrete Mathematics, 311(17), 1948–1956. https://doi.org/10.1016/j.disc.2011.05.018