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

Authors:
Hung-Lin Fu;F. K. Hwang
Affiliations:
Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, Taiwan, ROC;Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, Taiwan, ROC
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 0
Cited 4

A construction of dz-disjunct matrices in a dual space of symplectic space

Discrete Applied Mathematics
A combinatorial approach to X-tolerant compaction circuits

IEEE Transactions on Information Theory
Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2

Journal of Combinatorial Optimization
New construction of error-tolerant pooling designs

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.10

Visualization

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.