A Covering Separating System on a setX 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… (More)

@article{Phanalasy2009CoveringSS,
title={Covering separating systems and an application to search theory},
author={Oudone Phanalasy and Ian T. Roberts and Leanne J. Rylands},
journal={Australasian J. Combinatorics},
year={2009},
volume={45},
pages={3-14}
}