Large sets of combinatorial designs has always been a fascinating topic in design theory. These form partition the whole space into with same parameters. In particular, large set block designs, whose blocks are size k taken from an n-set, is all k-subsets n-set disjoint copies defined on and The current most intriguing question this direction whether Steiner quadruple systems exist to provide e...

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C (v; k; t). In this paper, a computer search for nding good such covering designs, leading to new upper bounds on C (v; k; t), is considered. The search is facilitated by predetermining automorphisms of desired covering designs. A stochastic heuristic search (embedded in the gen...