Optimal linear identifying codes
Identifying codes can be used to locate malfunctioning processors. We say that a code C of length n is a linear (1, less than or equal tol)-identifying code if it is a subspace of F-2(n) and for all X, Y subset of or equal to F-2(n) such that \X\, \Y\ less than or equal to l and X not equal Y, we have "GRAPHICS" Strongly (1, less than or equal tol)-identifying codes are a variant of identifying codes. We determine he cardinalities of optimal linear (1, less than or equal tol)-identifying and strongly (1, less than or equal tol)-identifying codes in Hamming spaces of any dimension for locating any at most l malfunctioning processors.
identifying codes hamming space code construction covering codes linear codes