New upper bounds on the minimum size of covering designs

Let D = {B1, B2,…, Bb} be a finite family of k-subsets (called blocks) of a v-set X(v) = {1, 2,…, v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size of the covering, and the minimum size of the covering is called the covering number, denoted C(v, k, t). This article is concerned with new constructions of coverings. The constructions improve many upper bounds on the covering number C(v, k, t)