General upper bounds on the minimum size of covering designs

DOI10.1006/JCTA.1998.2927MaRDI QIDQ1291117zbMATH OpenOpenAlexFDO

Authors Iliya Bluskov, Katherine Heinrich

Publication date 20 July 1999

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5fc0f94019d30c43189d223405f219511dcd6db5

zbMATH Keywords

constant weight covering code covering design covering number

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Review text

A collection of \(k\)-element subsets (called blocks) out of a \(v\)-set such that each \(t\)-subset of the \(v\)-set is contained in at least one block is called a \((v,k,t)\) covering design. The minimum size of a \((v,k,t)\) covering design is denoted by \(C(v,k,t)\). The authors present several constructions that give infinite families of good covering designs, which lead to new upper bounds on \(C(v,k,t)\). These constructions act on covering designs that can be partitioned into covering designs with other parameters (among others, resolvable designs are used), and on \(t\)-wise balanced designs.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: General upper bounds on the minimum size of covering designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291117)