On strongly identifying codes (Q1613540)

Given an undirected graph \(G=(V,E)\), the set of all vertices within distance \(t\) from a vertex \(v \in V\) is denoted by \(B_t(v)\). A set \(C \subseteq V\) is called a \(t\)-identifying code if all sets \(B_t(v)\cap C\) are nonempty and different. The authors define a new type of identifying codes, called strongly identifying codes, motivated by an application related to locating malfunctioning processors in a network. Bounds and constructions for these codes are given when \(G\) is the \(n\)-cube.