Optimal Codes for Strong Identification

Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, ≤ l)-identifying codes in Hamming spaces for every l when l ≥ 3.