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

Hung-Lin Fu; F. K. Hwang

doi:10.1016/j.dam.2006.03.009

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

Hung-Lin Fu^*, F. K. Hwang

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	1759-1762
Number of pages	4
Journal	Discrete Applied Mathematics
Volume	154
Issue number	12
DOIs	https://doi.org/10.1016/j.dam.2006.03.009
State	Published - 15 Jul 2006

Keywords

d-disjunct matrix
t-packing

Access to Document

10.1016/j.dam.2006.03.009

Fingerprint Dive into the research topics of 'A novel use of t-packings to construct d-disjunct matrices'. Together they form a unique fingerprint.

Cite this

@article{10b676b2ba324e4b99f2c0aca3e5631f,

title = "A novel use of t-packings to construct d-disjunct matrices",

abstract = "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.",

keywords = "d-disjunct matrix, t-packing",

author = "Hung-Lin Fu and Hwang, {F. K.}",

year = "2006",

month = jul,

day = "15",

doi = "10.1016/j.dam.2006.03.009",

language = "English",

volume = "154",

pages = "1759--1762",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "12",

}

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 -