Two families of optimal identifying codes in binary Hamming spaces
A motivation for identifying codes comes from quality control In multiprocessor systems, that is, we are able, with the aid of these codes, to rind faulty processors in such a system. In this correspondence, we give a construction of two infinite families of optimal codes, which identify up to two malfunctioning processors in Hamming spaces.
optimal identifying codes identifying codes hamming space binary codes code construction