×

Codes identifying sets of vertices. (English) Zbl 1057.94035

Boztaş, Serdar (ed.) et al., Applied algebra, algebraic algorithms and error-correcting codes. 14th international symposium, AAECC-14, Melbourne, Australia, November 26–30, 2001.
Proceedings. Berlin: Springer (ISBN 3-540-42911-5). Lect. Notes Comput. Sci. 2227, 82-91 (2001).
Summary: 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,\leq 2)\)-identifying codes which can find malfunctioning processors in a binary hypercube \({\mathbb F}_{2}^{n}\). Also two infinite families of optimal codes are given in the corresponding case of strong identification. Some results on more general graphs are provided as well.
For the entire collection see [Zbl 0983.00064].

MSC:

94B25 Combinatorial codes
94C12 Fault detection; testing in circuits and networks
94B65 Bounds on codes
PDFBibTeX XMLCite
Full Text: Link