<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

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

dc.citation.epage1762en_US
dc.citation.issue12en_US
dc.citation.spage1759en_US
dc.citation.volume154en_US
dc.citation.woscount9
dc.contributor.authorFu, HLen_US
dc.contributor.authorHwang, FKen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:16:11Z
dc.date.available2014-12-08T15:16:11Z
dc.date.issued2006-07-15en_US
dc.description.abstractA 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.identifier.doi10.1016/j.dam.2006.03.009en_US
dc.identifier.issn0166-218Xen_US
dc.identifier.journalDISCRETE APPLIED MATHEMATICSen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.dam.2006.03.009en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/12027
dc.identifier.wosnumberWOS:000238512400009
dc.language.isoen_USen_US
dc.subjectt-packingen_US
dc.subjectd-disjunct matrixen_US
dc.titleA novel use of t-packings to construct d-disjunct matricesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
000238512400009.pdf
Size:
147.22 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: