Covering separating systems and an application to search theory

Oudone Phanalasy; Ian T. Roberts; Leanne J. Rylands

Covering separating systems and an application to search theory

Oudone Phanalasy, Ian T. Roberts, Leanne J. Rylands

Research output: Contribution to journal › Article

2 Citations (Scopus)

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 language	English
Pages (from-to)	3-14
Number of pages	12
Journal	The Australasian Journal of Combinatorics
Volume	34
Publication status	Published - 2009

Keywords

combinatorial analysis
search theory

Cite this

@article{e2a469aa113a410a8580adcbdb91dc87,

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.",

keywords = "combinatorial analysis, search theory",

author = "Oudone Phanalasy and Roberts, {Ian T.} and Rylands, {Leanne J.}",

year = "2009",

language = "English",

volume = "34",

pages = "3--14",

journal = "The Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland",

}

TY - JOUR

T1 - Covering separating systems and an application to search theory

AU - Phanalasy, Oudone

AU - Roberts, Ian T.

AU - Rylands, Leanne J.

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.

KW - combinatorial analysis

KW - search theory

UR - http://handle.uws.edu.au:8081/1959.7/503697

M3 - Article

SN - 1034-4942

VL - 34

SP - 3

EP - 14

JO - The Australasian Journal of Combinatorics

JF - The Australasian Journal of Combinatorics

ER -

Covering separating systems and an application to search theory

Abstract

Keywords

Other files and links

Fingerprint

Cite this