New lower bound for 2-identifying code in the square grid

Details New lower bound for 2-identifying code in the square grid New lower bound for 2-identifying code in the square grid

2012-02-03

arxiv.org/abs/1202.0671v1

Mathematics

Combinatorics

Scientific paper

An $r$-identifying code in a graph $G = (V,E)$ is a subset $C \subseteq V$ such that for each $u \in V$ the intersection of $C$ and the ball of radius $r$ centered at $u$ is nonempty and unique. Previously, $r$-identifying codes have been studied in various grids. In particular, it has been shown that there exists a 2-identifying code in the square grid with density $5/29 \approx 0.172$ and that there are no 2-identifying codes with density smaller than $3/20 = 0.15$. Recently, the lower bound has been improved to $6/37 \approx 0.162$ by Martin and Stanton (2010). In this paper, we further improve the lower bound by showing that there are no 2-identifying codes in the square grid with density smaller than $6/35 \approx 0.171$.

Affiliated with

Also associated with

No associations

Rating

New lower bound for 2-identifying code in the square grid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New lower bound for 2-identifying code in the square grid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New lower bound for 2-identifying code in the square grid will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-4563