2 citations · 2 across the 17 of their papers we have counts for
Showing 1995Show all
2 papers · 1 filter
math.CO1995★ 2 cited
Asymptotically optimal covering designs
Daniel Gordon, Greg Kuperberg, Oren Patashnik +1
A (v,k,t) covering design, or 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…
math.CO1995
New constructions for covering designs
Daniel Gordon, Greg Kuperberg, Oren Patashnik
A {\em covering design}, or {\em covering}, is a family of -subsets, called blocks, chosen from a -set, such that each -subset is contained in at least one of th…