Optimal codes for strong identification

: Laihonen T

Publisher: ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD

: 2002

: European Journal of Combinatorics

: EUROPEAN JOURNAL OF COMBINATORICS

: EUR J COMBIN

: 23

: 3

: 307

: 313

: 7

: 0195-6698

DOI: https://doi.org/10.1006/eujc.2002.0571

Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, less than or equal to l)-identifying codes in Hamming spaces for every l when l greater than or equal to 3. (C) 2002 Elsevier Science Ltd. All rights reserved.