## Combinatorial Design and Pseudorandom Generator

For a set of size $$l$$, choose $$m$$ subsets each of size $$n$$ such that each pair of subsets has intersection size at most $$d$$. This gives a combinatorial design with parameters $$(m,l,n,d)$$. That is, we have \(I_1,\ldots, I_m \subseteq

Tagged with: , ,
Posted in Theory