Computer Science – Discrete Mathematics
Scientific paper
2010-04-23
Discrete Mathematics 311, 17 (2011) 1948-1956
Computer Science
Discrete Mathematics
Scientific paper
10.1016/j.disc.2011.05.018
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.
Delmas Olivier
Gravier Sylvain
Montassier Mickael
Parreau Aline
No associations
LandOfFree
On two variations of identifying codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On two variations of identifying codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On two variations of identifying codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-694162