Identification in Z2Z2 using Euclidean balls

The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes find their application, for example, in sensor networks. The network is modelled by a graph. In this paper, the goal is to find good identifying codes in a natural setting, that is, in a graph Er=(V,E)Er=(V,E) where V=Z2V=Z2 is the set of vertices and each vertex (sensor) can check its neighbours within Euclidean distance rr. We also consider a graph closely connected to a well-studied king grid, which provides optimal identifying codes for E5 and E13.