Improvement to lotto design tables
An (n, k, p, t) lotto design is a collection of k-subsets of a set X of n numbers wherein every p-subset of X must intersect at least one k-subset in t or more elements. L(n,k,p,t) is the minimum number of k-subsets which guarantees an intersection of at least t numbers between any p-subset of X and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1993/105 |