A Direct Construction of Transversal Covers Using Group Divisible Designs

Ars Combinatoria

Volumn 63, Issue , 2002, Pages 145-159

  Stevens, Brett ^a   Ling, Alan ^b   Mendelsohn, Eric ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0142168997     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. T. Beth, D. Jungnickel, and H. Lenz. Design Theory. Cambridge University Press, Cambridge, 1985.
2. R.C. Bose. An affine analogue of Singer's theorem. J. Ind. Math. Soc., 6:1-15, 1942.
3. M. A. Chateauneuf, C. J. Colbourn, and D. L. Kreher. Covering arrays of strength three. Des. Codes Cryptogr., 16(3):235-242, 1999.
4. D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton. The AETG system: An approach to testing based on combinatorial design. IEEE Trans. Soft. Eng., 23:437-444, 1997.
5. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton. The combinatorial design approach to automatic test generation. IEEE Software, 13(5):83-88, Sep. 1996.
6. C. J. Colbourn and J. H. Dinitz, editors. The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton, 1996.
7. L. Gargano, J. Körner, and U. Vaccaro. Qualitative independence and Sperner problems for directed graphs. J. Combin. Theory. Ser. A, 61:173-192, 1992.
8. L. Gargano, J. Körner, and U. Vaccaro. Sperner capacities. Graphs Combin., 9:31-46, 1993.
9. L. Gargano, J. Körner, and U. Vaccaro. Capacities: From information theory to extremal set theory. J. Combin. Theory. Ser. A, 68:296-316, 1994.
10. G. O. H. Katona. Two applications (for search theory and truth functions) of Sperner type theorems. Period. Math. Hungar., 3:19-26, 1973.
11. D. J. Kleitman and J. Spencer. Families of k-independent sets. Discrete Math., 6:255-262, 1973.
12. J. Körner and M. Lucertini. Compressing inconsistent data. IEEE Trans. Inform. Theory, 40(3):706-715, May 1994.
13. S. Poljak, A. Pultr, and V. Rödl. On qualitatively independent partitions and related problems. Discrete Applied Mathematics, 6:193-205, 1983.
14. S. Poljak and Z. Tuza. On the maximum number of qualitatively independent partitions. Journal of Combinatorial Theory, 51:111-116, 1989.
15. A. Rényi. Foundations of Probability. Wiley, New York, 1971.
16. N. J. A. Sloane. Covering arrays and intersecting codes. J. of Combin. Des., 1:51-63, 1993.
17. B. Stevens and E. Mendelsohn. New recursive methods for transversal covers. J. Combin. Des., 7(3):185-203, 1999.
18. Brett Stevens, Lucia Moura, and Eric Mendelsohn. Lower bounds for transversal covers. Des. Codes Cryptogr., 15(3):279-299, 1998.
19. A.W. Williams and R.L. Probert. A practical strategy for testing pair-wise convergence of network interfaces. Proc. of the 7th International Symposium on Software Reliability Engineering, pages 246-254, 1996.