Abstract
We consider identifying and strongly identifying codes. Finding faulty processors in a multiprocessor system gives the motivation for these codes. Constructions and lower bounds on these codes are given. We provide two infinite families of optimal (1, ≤ 2)-identifying codes, which can find malfunctioning processors in a binary hypercube Fn2. Also two infinite families of optimal codes are given in the corresponding case of strong identification. Some results on more general graphs are as well provided.
Cite
CITATION STYLE
Laihonen, T., & Ranto, S. (2001). Codes identifying sets of vertices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2227, pp. 82–91). Springer Verlag. https://doi.org/10.1007/3-540-45624-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
