Tolerant identification with Euclidean balls

Details Tolerant identification with Euclidean balls Tolerant identification with Euclidean balls

2011-09-09

arxiv.org/abs/1109.1913v3

Computer Science

Information Theory

Scientific paper

The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper, we consider as sensors the set Z^2 where one sensor can check its neighbours within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighbourhood monitored by each sensor. We give bounds for the smallest density of a tolerant identifying code for general values of r and Delta. We also provide infinite families of values (r,Delta) with optimal such codes and study the case of small values of r.

Affiliated with

Also associated with

No associations

Rating

Tolerant identification with Euclidean balls 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 Tolerant identification with Euclidean balls, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tolerant identification with Euclidean balls will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413081