7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Spatial messaging is a term that defines the virtual publication of data in physical places. Generally, anyone in the neighborhood of such a publication point gets the message. F...
In this paper we introduce Active Monte Carlo Recognition (AMCR), a new approach for object recognition. The method is based on seeding and propagating "relational" part...
Different generalizations to the case of coverings of the standard approach to entropy applied to partitions of a finite universe X are explored. In the first approach any cover...