Identifying codes and locating-dominating codes have been designed for locating irregularities in sensor networks. In both cases, we can locate only one irregularity and cannot even detect multiple ones. To overcome this issue, self-identifying codes have been introduced which can locate one irregularity and detect multiple ones. In this paper, we define two new classes of locating-dominating codes which have similar properties. These new locating-dominating codes as well as the regular ones are then more closely studied in the rook’s graphs and binary Hamming spaces.

In the rook’s graphs, we present optimal codes, i.e., codes with the smallest possible cardinalities, for regular location-domination as well as for the two new classes. In the binary Hamming spaces, we present lower bounds and constructions for the new classes of codes; in some cases, the constructions are optimal. Moreover, one of the obtained lower bounds improves the bound of Honkala et al. (2004) on codes for locating multiple irregularities.

Besides studying the new classes of codes, we also present record-breaking constructions for regular locating-dominating codes. In particular, we present a locating-dominating code in the binary Hamming space of length 11 with 320 vertices improving the earlier bound of 352; the best known lower bound for such code is 309 by Honkala et al. (2004).