Name
Abstract | ||
|---|---|---|
An identifying code C is a subset of the vertices of the square grid ${\mathbb Z}^2$ with the property that for each element v of ${\mathbb 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 ${\mathbb Z}^2$ is $\frac{7}{20}$. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/S0895480104444089 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
identifying code,minimum density,code c,graph,density,element v,square grid,exact minimum density,mathbb z | Graph theory,Graph,Discrete mathematics,Combinatorics,Square tiling,Vertex (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
19 | 1 | 0895-4801 |
Citations | PageRank | References |
42 | 1.84 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Ben-Haim | 1 | 140 | 8.29 |
| Simon N. Litsyn | 2 | 843 | 106.44 |