On strongly identifying codes

: Honkala I, Laihonen T, Ranto S

Publisher: ELSEVIER SCIENCE BV

: 2002

: Discrete Mathematics

: DISCRETE MATHEMATICS

: DISCRETE MATH

: 254

: 1-3

: 191

: 205

: 15

: 0012-365X

DOI: https://doi.org/10.1016/S0012-365X(01)00357-0(external)

Identifying codes are designed for locating faulty processors in multiprocessor systems. In this paper we consider a natural extension of this problem and introduce strongly identifying codes. Several lower bounds and constructions are given and relations between different types of identifying codes are examined. (C) 2002 Elsevier Science B.V. All rights reserved.

Mathematics