Welcome to the Covering Repository website
The aim of this website is to collect the best wheeling systems (a.k.a. lottery wheeling, lotto designs, covering designs) known today.
A Covering Design c(v, k, t, m, b) is a pair (V, B), where V is a set of v elements (called points) and B is a collection of b k-subsets of V
(called blocks) such that every m-subset of V intersects at least one member of B in at least t points.
We host coverings with v > k ≥ t and v > m > t.
Allowed values: 4 ≤ v ≤ 90 , 2 ≤ k ≤ 15 , 2 ≤ t ≤ 15 , 3 ≤ m ≤ 20