We consider the problem of covering a point pattern---a finite set of points in the interval [0,T]---with a (generally infinite) subset of [0,T] that is drawn from a predefined codebook. We study the trade-off between the size of the codebook and the Lebesgue measures of its codewords. This is done both for random point processes (such as Poisson processes) and for arbitrary point patterns that are drawn by an adversary.
Ligong Wang is a postdoctoral associate at MIT since 2011. He obtained his bachelor's degree in electronic engineering from Tsinghua University, Beijing, China, in 2004. He then entered ETH Zurich (Swiss Federal Institute of Technology), where he completed the master's degree and the doctorate in electrical engineering in 2006 and 2011, respectively. His research interests include classical and quantum information theory, and optical communications.