Covering Point Patterns

Details Covering Point Patterns Covering Point Patterns

2011-02-15

arxiv.org/abs/1102.3080v1

Computer Science

Information Theory

5 pages. Submitted to ISIT 2011

Scientific paper

An encoder observes a point pattern---a finite number of points in the interval $[0,T]$---which is to be described to a reconstructor using bits. Based on these bits, the reconstructor wishes to select a subset of $[0,T]$ that contains all the points in the pattern. It is shown that, if the point pattern is produced by a homogeneous Poisson process of intensity $\lambda$, and if the reconstructor is restricted to select a subset of average Lebesgue measure not exceeding $DT$, then, as $T$ tends to infinity, the minimum number of bits per second needed by the encoder is $-\lambda\log D$. It is also shown that, as $T$ tends to infinity, any point pattern on $[0,T]$ containing no more than $\lambda T$ points can be successfully described using $-\lambda \log D$ bits per second in this sense. Finally, a Wyner-Ziv version of this problem is considered where some of the points in the pattern are known to the reconstructor.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378498