New upper bounds on the minimum size of covering designs

Journal of Combinatorial Designs

Volumn 6, Issue 1, 1998, Pages 21-41

  Bluskov, Iliya ^a   Hämäläinen, Heikki ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b Department of Mathematics ^*  (Finland)

Author keywords

Constant weight covering code; Covering; Design

Indexed keywords

EID: 0041303551     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1998)6:1<21::AID-JCD2>3.0.CO;2-Y     Document Type: Article

References (25)

1. W. O. Alltop, Extending t-designs, J. Combin. Theory A 18 (1975), 177-186.
2. A. H. Baartmans, I. D. Bluskov, and V. D. Tonchev, The Preparata codes and a class of 4-designs, J. Combin. Des. 2 (1994), 167-170.
3. Z. Baranyai, On the factorization of the complete uniform hypergraph, Colloquia Math. Soc. Janos Bolyai 10 (1975), 91-108.
4. R. Belić, Private communication.
5. I. D. Bluskov, Designs with maximally different blocks and v = 15, 16, Utilitas Math., 50 (1996), 203-213.
6. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, A new table of constant weight codes, IEEE Transac. Info. Theory 36 (1990), 1334-1380.
7. P. J. Cameron and J. H. Van Lint, Designs, graphs, codes and their links, Cambridge University Press, New York, 1991, pp. 185-193.
8. A. H. Chan and R. A. Games, (n, k, t)-covering systems and error-trapping decoding, IEEE Transact. Info. Theory 27 (1981), 643-646.
9. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, and J. R. Schatz, Covering radius-survey and recent results, IEEE Transac. Info. Theory IT-31 (1985), 328-343.
10. J. H. Conway and N. J. A. Sloane, Lexicographical codes: Error-correcting codes from game theory, IEEE Transac. Info. Theory 32 (1986), 337-348.
11. T. Etzion and C. L. M. Van Pul, New lower bounds for constant weight codes, IEEE Transac. Info. Theory 35 (1989), 1324-1329.
12. T. Etzion, V. Wei, and Z. Zhang, Bounds on the sizes of constant weight covering codes, Designs, Codes and Crypto. 5 (1995), 217-239.
13. T. Etzion, Large sets of coverings, J. Combin. Des. 2 (1994), 359-374.
14. D. M. Gordon, G. Kuperberg, and O. Patashnik, New constructions for covering designs, J. Combin. Des. 3, 4 (1995), 269-284.
15. T. S. Griggs and A. Rosa, "Large sets of Steiner triple systems," in Surveys in combinatorics, P. Rowlinson (Editor), London Mathematical Society, 1995, pp. 25-39.
16. W. H. Mills and R. C. Mullin, "Coverings and packings," in Contemporary design theory: A collection of surveys, J. H. Dinitz and D. R. Stinson (Editors), Wiley, 1992, pp. 371-399.
17. M. Morley and G. H. J. van Rees, Lottery schemes and covers, Utilitas Mathematica 37 (1990), 159-166.
18. H. K. Nandi, Enumeration of nonisomorphic solutions of balanced incomplete block designs, Sankhya 7 (1946), 305-312.
19. K. J. Nurmela and P. R. J. Östergȧrd, Constructing covering designs by simulated annealing, Helsinki University of Technology, Digital Systems Laboratory, Series B: Technical Reports, 10 (1993), ISSN 0783-540X, ISBN 951-22-1382-6.
20. K. J. Nurmela and P. R. J. Östergȧrd, Upper bounds for covering designs by simulated annealing, Congressus Numer. 96 (1993), 93-111.
21. F. Oats, Private communication.
22. W. Oberschelp, Lotto-Garantiesysteme und Blokplane, Math.-Phys. Semesterberichte XIX (1972), 55-67.
23. J. Schönheim, On coverings, Pacific J. Math. 14 (1964), 1405-1411.
24. L. Tierlinck, A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems, J. Combin. Theory (A) 57 (1991), 302-305.
25. E. Witt, Uber Steinersche Systeme, Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 12 (1938), 265-275.