| Exact minimum density of codes identifying vertices in the square grid (2008) | |||||||||||||||||
Abstract | |||||||||||||||||
| Abstract. An identifying code C is a subset of the vertices of the square grid Z 2 with the property that for each element v of Z 2, the collection of elements from C at a distance of at most one from v is nonempty and distinct from the collection of any other vertex. We prove that the minimum density of C within Z 2 is 7 | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||