par Bougard, Nicolas
Référence Journal of combinatorial designs, 14, 5, page (333-350)
Publication Publié, 2006
Article révisé par les pairs
Résumé : An (n, k, p, t)-lotto design is an n-set N and a set B of k-subsets of N (called blocks) such that for each p-subset P of N, there is a block B ∈ B for which