On two variations of identifying codes

Aline Parreau (IF); Mickael Montassier (LaBRI); Olivier Delmas (LaBRI); Sylvain Gravier (IF)

arxiv: 1004.4063 · v2 · pith:PLWFJIAWnew · submitted 2010-04-23 · 💻 cs.DM · cs.IT· math.CO· math.IT

On two variations of identifying codes

Olivier Delmas (LaBRI) , Sylvain Gravier (IF) , Mickael Montassier (LaBRI) , Aline Parreau (IF) This is my paper

classification 💻 cs.DM cs.ITmath.COmath.IT

keywords codesidentifyingfault-detectionvariationsbeenboundscorrespondcycles

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

On two variations of identifying codes

discussion (0)