Title :
Two families of optimal identifying codes in binary Hamming spaces
Author :
Ranto, Sanna M. ; Honkala, Iiro S. ; Laihonen, Tero K.
Author_Institution :
Turku Centre for Comput. Sci. TUCS, Finland
fDate :
5/1/2002 12:00:00 AM
Abstract :
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
Keywords :
binary codes; multiprocessing systems; optimisation; quality control; binary Hamming spaces; binary codes; faulty processors; multiprocessor systems; optimal identifying codes; quality control; short optimal codes; Codes; Computer science; Fault diagnosis; Hamming distance; Lattices; Mathematics; Multiprocessing systems; Quality control;
Journal_Title :
Information Theory, IEEE Transactions on
