Two families of optimal identifying codes in binary Hamming spaces
Sanna Ranto, Iiro S. Honkala, Tero K Laihonen · IEEE Transactions on Information Theory · 2002
A motivation for identifying codes comes from quality control in multiprocessor systems, that is, we are able, with the aid of these codes, to find faulty processors in such a system. We give a construction of two infinite families of optimal codes, which identify up to two malfunctioning processors in Hamming spaces.