Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420746 | Discrete Applied Mathematics | 2006 | 4 Pages |
Abstract
A t -packing is an ordered pair (V,P)(V,P) where V is a vv-set and PP is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of PP. If each t-subset of V occurs in exactly one block of PP, then (V,P)(V,P) is known as a Steiner (t,k,v)(t,k,v)-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hung-Lin Fu, F.K. Hwang,