A Covering Separating System on a set X is a collection of blocks in which each element of X appears at least once, and for each pair of distinct points a,b ? X, there is a block containing a and not b, or vice versa. An introduction to Covering Separating Systems is given, constructions are described for a class of minimal Covering Separating Systems and an application to Search Theory is presented.
|Number of pages||12|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - 2009|