Covering separating systems and an application to search theory

Oudone Phanalasy, Ian T. Roberts, Leanne Rylands · CDU eSpace Institutional Repository (Charles Darwin University) · 2009

\t\t\tA 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.

Read the paper · More papers on PaperTik