TY - JOUR

T1 - A novel use of t-packings to construct d-disjunct matrices

AU - Fu, Hung-Lin

AU - Hwang, F. K.

PY - 2006/7/15

Y1 - 2006/7/15

N2 - A t-packing is an ordered pair ( V, P ) where V is a v-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, v )-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices.

AB - A t-packing is an ordered pair ( V, P ) where V is a v-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, v )-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices.

KW - d-disjunct matrix

KW - t-packing

UR - http://www.scopus.com/inward/record.url?scp=33646909635&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2006.03.009

DO - 10.1016/j.dam.2006.03.009

M3 - Article

AN - SCOPUS:33646909635

VL - 154

SP - 1759

EP - 1762

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 12

ER -