Covering separating systems and an application to search theory

O PHANALASY, Ian Roberts, L RYLANDS

    Research output: Contribution to journalArticle

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)3-14
    Number of pages12
    JournalAustralasian Journal of Combinatorics
    Volume45
    Publication statusPublished - 2009

    Fingerprint Dive into the research topics of 'Covering separating systems and an application to search theory'. Together they form a unique fingerprint.

    Cite this