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 F2 n 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.