On two variations of identifying codes
Olivier Delmas (LaBRI), Sylvain Gravier (IF), Mickael Montassier, (LaBRI), Aline Parreau (IF)
TL;DR
This paper introduces two new variations of identifying codes, called weak and light codes, which model fault detection over multiple rounds, and provides exact bounds for these codes on cycle graphs.
Contribution
The paper defines weak and light identifying codes and establishes exact bounds for these codes specifically on cycle graphs.
Findings
Exact bounds for weak codes on cycles
Exact bounds for light codes on cycles
Introduction of two new code variations for fault detection
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.