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

Discrete Applied Mathematics

Volumn 154, Issue 12, 2006, Pages 1759-1762

  Fu, Hung Lin ^a   Hwang, F K ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

d disjunct matrix; t packing

Indexed keywords

FINITE DIFFERENCE METHOD; SET THEORY;

D-DISJUNCT MATRICES; ORDERED PAIRS; STEINER ( T, K, V )-DESIGN; T-PACKING;

MATRIX ALGEBRA;

EID: 33646909635     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.03.009     Document Type: Article

References (7)

1. Brouwer A.E. Packing and covering of ( frac(k, t) )-sets. Math. Center Tracts 106 (1979) 89-97
2. C.J. Collbourn, J.H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996, pp. 47-74.
3. Erdös P., Frankl P., and Füredi D. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51 (1985) 79-89
4. Kautz W.H., and Singleton R.R. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory 10 (1964) 363-377
5. Macula A.J. A simple construction of d-disjunct matrices with certain constant weights. Discrete Appl. Math. 80 (1996) 217-222
6. Rödl V. On a packing and covering problem. European J. Combin. 5 (1984) 69-78
7. Sinha G.M., Pesotan H., and Raktoc B.L. Some results on t-complete designs. Ars Combin. 13 (1982) 195-201