New constructions for covering designs

Details New constructions for covering designs New constructions for covering designs

1995-02-16

arxiv.org/abs/math/9502238v1

J. Combin. Des. 4 (1995), no. 4, 269-284

Mathematics

Combinatorics

Scientific paper

A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks. The number of blocks is the covering's {\em size}, and the minimum size of such a covering is denoted by $C(v,k,t)$. This paper gives three new methods for constructing good coverings: a greedy algorithm similar to Conway and Sloane's algorithm for lexicographic codes~\cite{lex}, and two methods that synthesize new coverings from preexisting ones. Using these new methods, together with results in the literature, we build tables of upper bounds on $C(v,k,t)$ for $v \leq 32$, $k \leq 16$, and $t \leq 8$.%

Affiliated with

Also associated with

No associations

Rating

New constructions for covering designs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New constructions for covering designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New constructions for covering designs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518810