Covering separating systems and an application to search theory

O PHANALASY, Ian Roberts, L RYLANDS

    Research output: Contribution to journalArticleResearchpeer-review

    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

    Search Theory
    Covering Systems
    Distinct

    Cite this

    PHANALASY, O ; Roberts, Ian ; RYLANDS, L. / Covering separating systems and an application to search theory. In: Australasian Journal of Combinatorics. 2009 ; Vol. 45. pp. 3-14.
    @article{f5c5882ed4a9421f8d802ca964417e16,
    title = "Covering separating systems and an application to search theory",
    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.",
    author = "O PHANALASY and Ian Roberts and L RYLANDS",
    year = "2009",
    language = "English",
    volume = "45",
    pages = "3--14",
    journal = "Australasian Journal of Combinatorics",
    issn = "1034-4942",
    publisher = "Centre for Discrete Mathematics & Computing",

    }

    PHANALASY, O, Roberts, I & RYLANDS, L 2009, 'Covering separating systems and an application to search theory', Australasian Journal of Combinatorics, vol. 45, pp. 3-14.

    Covering separating systems and an application to search theory. / PHANALASY, O; Roberts, Ian; RYLANDS, L.

    In: Australasian Journal of Combinatorics, Vol. 45, 2009, p. 3-14.

    Research output: Contribution to journalArticleResearchpeer-review

    TY - JOUR

    T1 - Covering separating systems and an application to search theory

    AU - PHANALASY, O

    AU - Roberts, Ian

    AU - RYLANDS, L

    PY - 2009

    Y1 - 2009

    N2 - 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.

    AB - 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.

    M3 - Article

    VL - 45

    SP - 3

    EP - 14

    JO - Australasian Journal of Combinatorics

    JF - Australasian Journal of Combinatorics

    SN - 1034-4942

    ER -