{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:50:45Z","timestamp":1761292245311},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1007\/bf01388385","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T03:37:09Z","timestamp":1112413029000},"page":"217-239","source":"Crossref","is-referenced-by-count":16,"title":["Bounds on the sizes of constant weight covering codes"],"prefix":"10.1007","volume":"5","author":[{"given":"Tuvi","family":"Etzion","sequence":"first","affiliation":[]},{"given":"Victor","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"E. D. Boyer, D. L. Kreher, S. P. Radziszowski, J. Zou, and A. Sidorenko, On (n, 5, 3)-Tur\u00e1n systems, preprint."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"A. E. Brouwer","year":"1990","unstructured":"A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, A new table of constant weight codes.IEEE Trans. on Information Theory, Vol. IT-36 (1990) pp. 1334?1380.","journal-title":"IEEE Trans. on Information Theory"},{"key":"CR3","first-page":"99","volume":"106","author":"A. E. Brouwer","year":"1979","unstructured":"A. E. Brouwer and M. Voorhoeve, Tur\u00e1n theory and lotto problem.Math. Centre Tracts, Vol. 106 (1979) pp. 99?105.","journal-title":"Math. Centre Tracts"},{"key":"CR4","unstructured":"D. de Caen, On Tur\u00e1n's Hypergraph problem, Ph.D. thesis, University of Toronto (1982)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0095-8956(83)90045-X","volume":"34","author":"D. Caen de","year":"1983","unstructured":"D. de Caen, A note on the probabilistic approach to Tur\u00e1n's problem.J. of Combinatorial Theory, Ser. B, Vol. 34 (1983), pp. 340?349.","journal-title":"J. of Combinatorial Theory, Ser. B"},{"key":"CR6","first-page":"5","volume":"16","author":"D. Caen de","year":"1983","unstructured":"D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs,Ars Combinatoria, Vol. 16 (1983), pp. 5?10.","journal-title":"Ars Combinatoria"},{"key":"CR7","first-page":"277","volume":"65","author":"D. Caen de","year":"1988","unstructured":"D. de Caen, D. L. Kreher, and J. Wiseman. On constructive upper bounds for the Tur\u00e1n numbers.Congressus Numerantium, Vol. 65 (1988), pp. 277?280.","journal-title":"Congressus Numerantium"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(91)90267-6","volume":"92","author":"D. Caen de","year":"1991","unstructured":"D. de Caen, D. L. Kreher, S. P. Radziszowski, and W. H. Mills, On the covering oft-sets with (t+1)-sets:C(9, 5, 4) andC(10, 6, 5).Discrete Mathematics, Vol. 92 (1991) pp. 65?77.","journal-title":"Discrete Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"31","author":"G. D. Cohen","year":"1985","unstructured":"G. D. Cohen, M. G. Karpovsky, H. F. Mattson Jr., and J. R. Schatz, Covering radius?survey and recent results,IEEE Trans. on Information Theory, Vol. IT-31 (1985) pp. 328?343.","journal-title":"IEEE Trans. on Information Theory"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/jcd.3180020509","volume":"2","author":"T. Etzion","year":"1994","unstructured":"T. Etzion, Large sets of coverings,J of Combinatorial Design, vol. 2 (1994), 359?373.","journal-title":"J of Combinatorial Design"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"709","DOI":"10.2140\/pjm.1958.8.709","volume":"8","author":"M. K. Fort Jr.","year":"1958","unstructured":"M. K. Fort Jr. and G. A. Hedlund, Minimal coverings of pairs by triples,Pacific J. Math., Vol. 8 (1958) pp. 709?717.","journal-title":"Pacific J. Math."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"R. L. Graham","year":"1980","unstructured":"R. L. Graham and N. J. A. Sloane, Lower bounds for constant weight codes,IEEE Trans. on Information Theory, Vol. IT-26 (1980) pp. 37?43.","journal-title":"IEEE Trans. on Information Theory"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/TIT.1974.1055248","volume":"20","author":"R. L. Gray","year":"1974","unstructured":"R. L. Gray and L. D. Davisson, Source coding theorems without the ergodic assumption.IEEE Trans. on Information Theory, Vol. IT-20, (1974) pp. 502?516.","journal-title":"IEEE Trans. on Information Theory"},{"key":"CR14","first-page":"155","volume":"9","author":"H. Hanani","year":"1964","unstructured":"H. Hanani, D. Ornstein, and V. T. Sos, On the lottery problem,Magyer Tud. Akad. Mat. Kutato Int. Kozl., Vol. 9 (1964) pp. 155?158.","journal-title":"Magyer Tud. Akad. Mat. Kutato Int. Kozl."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0097-3165(91)90024-B","volume":"56","author":"H. H\u00e4m\u00e4l\u00e4inen","year":"1991","unstructured":"H. H\u00e4m\u00e4l\u00e4inen and S. Rankinen, Upper bounds for football pool problems and mixed covering codes.J. of Combinatorial Theory, Ser. A, Vol. 56 (1991) pp. 84?95.","journal-title":"J. of Combinatorial Theory, Ser. A"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0097-3165(86)90119-6","volume":"41","author":"A. Hartman","year":"1986","unstructured":"A. Hartman, W. H. Mills, and R. C. Mullin, Covering triples by quadruples,J. of Combinatorial Theory, Ser. A, Vol. 41 (1986) pp. 117?138.","journal-title":"J. of Combinatorial Theory, Ser. A"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/18.75253","volume":"37","author":"I. S. Honkala","year":"1991","unstructured":"I. S. Honkala, Modified bounds for covering codes.IEEE Trans. on Information Theory, Vol. IT-37 (1991) pp. 351?365.","journal-title":"IEEE Trans. on Information Theory"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.4153\/CJM-1975-031-3","volume":"27","author":"C. C. Lindner","year":"1974","unstructured":"C. C. Lindner and A. Rosa, Constructions of large sets of almost disjoint Steiner triple systems,J. Canad. Math., Vol. 27 (1974) pp. 256?260.","journal-title":"J. Canad. Math."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0097-3165(83)90052-3","volume":"34","author":"J. X. Lu","year":"1983","unstructured":"J. X. Lu, On large sets of disjoint Steiner triple systems I?III,J. of Combinatorial Theory, Ser. A, Vol. 34 (1983) pp. 140?146, 147?155, 156?183.","journal-title":"J. of Combinatorial Theory, Ser. A"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0097-3165(84)90066-9","volume":"37","author":"J. X. Lu","year":"1984","unstructured":"J. X. Lu, On large sets of disjoint Steiner triple systems IV?VI,J. of Combinatorial Theory, Ser. A, Vol. 37 (1984) pp. 136?163, 164?188, 189?192.","journal-title":"J. of Combinatorial Theory, Ser. A"},{"key":"CR21","unstructured":"W. H. Mills, Covering problems,Proc. 4th S-E Conf. Combinatorics, Graph Theory, and Computing, (1973) pp. 23?52."},{"key":"CR22","first-page":"29","volume":"73","author":"W. H. Mills","year":"1990","unstructured":"W. H. Mills, Constructions of covering designs,Congressus Numerantium, Vol. 73 (1990) pp. 29?36.","journal-title":"Congressus Numerantium"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V. R\u00f6dl","year":"1985","unstructured":"V. R\u00f6dl, On a packing and covering problem,Europ. J. Combin., Vol. 6 (1985) pp. 69?78.","journal-title":"Europ. J. Combin."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","volume":"14","author":"J. Sch\u00f6nheim","year":"1964","unstructured":"J. Sch\u00f6nheim, On Coverings,Pacific. J. Math., Vol. 14 (1964) pp. 1405?1411.","journal-title":"Pacific. J. Math."},{"key":"CR25","unstructured":"T. H. Spencer, On the size of independent sets in hypergraphs, Marshall Hall conference on Codes, Designs, and Groups, University of Vermont, September 13?18 (1990)."},{"key":"CR26","series-title":"Lecture Notes in Math.","first-page":"37","volume-title":"A computer search for B-coverings","author":"R. G. Stanton","year":"1981","unstructured":"R. G. Stanton and J. A. Bate, A computer search for B-coverings, Combinatorial Math. VII, Lecture Notes in Math., Springer-Verlag, New York, 829 (1981) pp. 37?50."},{"key":"CR27","unstructured":"R. G. Stanton, J. G. Kalbfleisch, and R. C. Mullin, Covering and packing designs, Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and its Applications, University of North Carolina, Chapel Hill, NC (1970) pp. 428?450."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(91)90053-J","volume":"57","author":"L. Teirlinck","year":"1991","unstructured":"L. Teirlinck, A completion of Lu's determination of the spectrum for large sets of disjoint Steiner systems,J. of Combinatoridl Theory, Ser. A, Vol. 57 (1991) pp. 302?305.","journal-title":"J. of Combinatoridl Theory, Ser. A"},{"key":"CR29","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n, Eine extremalaufgabe aus der Graphentheorie,Math. Fiz. Lapok, Vol. 48 (1941) pp. 436?452.","journal-title":"Math. Fiz. Lapok"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"146","DOI":"10.4064\/cm-3-1-19-30","volume":"3","author":"P. Tur\u00e1n","year":"1954","unstructured":"P. Tur\u00e1n, On the theory of graphs,Colloq. Math., Vol. 3 (1954) pp. 146?163.","journal-title":"Colloq. Math."},{"key":"CR31","first-page":"417","volume":"6","author":"P. Tur\u00e1n","year":"1961","unstructured":"P. Tur\u00e1n, Research problems,Kozl. MTA Mat. Kutato Int., Vol. 6 (1961) pp. 417?423.","journal-title":"Kozl. MTA Mat. Kutato Int."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"1324","DOI":"10.1109\/18.45293","volume":"35","author":"C. L. Pul van","year":"1989","unstructured":"C. L. van Pul and T. Etzion, New lower bounds for constant weight codes,IEEE Trans. on Inform. Theory, Vol. IT-35 (1989) pp. 1324?1329.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"CR33","unstructured":"V. Wei and Z. Zhang, manuscript in preparation."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388385\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388385.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388385\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:14:18Z","timestamp":1556799258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["BF01388385"],"URL":"https:\/\/doi.org\/10.1007\/bf01388385","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}