1. Ben-Haim, Y., Litsyn, S.: Exact minimum density of codes identifying vertices in the square grid. SIAM J. Discrete Math. 19, 69–82 (2005)
2. Charon, I., Honkala, I., Hudry, O., Lobstein, A.: General bounds for identifying codes in some infinite regular graphs. Electron. J. Comb. 8(1), Research Paper 39, 21 pp. (2001)
3. Cohen, G., Gravier, S., Honkala, I., Lobstein, A., Mollard, M., Payan, C., Zémor, G.: Improved identifying codes for the grid, Comment to [4]
4. Cohen, G., Honkala, I., Lobstein, A., Zémor, G.: New bounds for codes identifying vertices in graphs. Electron. J. Comb. 6(1), R19 (1999)
5. Cukierman, A., Yu, G.: New bounds on the minimum density of an identifying code for the infinite hexagonal grid discrete. Appl. Math. 161, 2910–2924 (2013)