A t-packing is an ordered pair (V, P) where V is a nu-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-subset of V occurs in exactly one block of P, then (V, P) is known as a Steiner (t, k, nu)-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices. (c) 2006 Elsevier B.V. All rights reserved.
展开▼
