Exact Minimum Density of Codes Identifying Vertices in the Square Grid

@article{BenHaim2005ExactMD,
  title={Exact Minimum Density of Codes Identifying Vertices in the Square Grid},
  author={Yael Ben-Haim and Simon Litsyn},
  journal={SIAM J. Discrete Math.},
  year={2005},
  volume={19},
  pages={69-82}
}
Exact Minimum Density of Codes Identifying Vertices in the Square Grid Yael Ben-Haim and Simon Litsyn School of Electrical Engineering Tel-Aviv University Tel-Aviv 69978 Israel An identifying codeC is a subset of the vertices of the square grid Z with the property that for each element v of Z, the collection of elements fromC at distance at most one fromv is non-empty and distinct from the collection of any other vertex. We prove that the minimum density of C within Z is 7 20 . 
38 Citations
26 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Lobstein , Identifying codes with small radius in some infinite regular graphs

  • O. Hudry I. Charon, A.
  • Electron . J . Combin .
  • 2002

Lobstein , On identifying codes in binary Hamming spaces

  • I. Honkala, A.
  • J . Combin . Theory Ser . A
  • 2002

Lobstein , On the density of identifying codes in the square lattice

  • I. Honkala, A.
  • J . Combin . Theory Ser . B
  • 2002

Similar Papers

Loading similar papers…