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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Hwang, FK	en_US
dc.date.accessioned	2014-12-08T15:16:11Z	-
dc.date.available	2014-12-08T15:16:11Z	-
dc.date.issued	2006-07-15	en_US
dc.identifier.issn	0166-218X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.dam.2006.03.009	en_US
dc.identifier.uri	http://hdl.handle.net/11536/12027	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	t-packing	en_US
dc.subject	d-disjunct matrix	en_US
dc.title	A novel use of t-packings to construct d-disjunct matrices	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.dam.2006.03.009	en_US
dc.identifier.journal	DISCRETE APPLIED MATHEMATICS	en_US
dc.citation.volume	154	en_US
dc.citation.issue	12	en_US
dc.citation.spage	1759	en_US
dc.citation.epage	1762	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000238512400009	-
dc.citation.woscount	9	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.