On two variations of identifying codes
Discrete Mathematics
2011-06-21 v2 Information Theory
Combinatorics
math.IT
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.
Keywords
Cite
@article{arxiv.1004.4063,
title = {On two variations of identifying codes},
author = {Olivier Delmas and Sylvain Gravier and Mickael Montassier and Aline Parreau},
journal= {arXiv preprint arXiv:1004.4063},
year = {2011}
}