{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:14Z","timestamp":1772283734615,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00287-5","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T04:08:46Z","timestamp":1065672526000},"page":"463-477","source":"Crossref","is-referenced-by-count":61,"title":["Generalized cover-free families"],"prefix":"10.1016","volume":"279","author":[{"given":"D.R.","family":"Stinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00287-5_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0378-3758(84)90058-2","article-title":"New combinatorial designs and their application to group testing","volume":"10","author":"Bush","year":"1984","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB2","doi-asserted-by":"crossref","unstructured":"R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, B. Pinkas, Multicast security: a taxonomy and some efficient constructions, In Proceedings of INFOCOM \u201999, Vol. 2, pp. 708\u2013716.","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S1389-1286(00)00169-9","article-title":"Broadcast anti-jamming systems","volume":"35","author":"Desmedt","year":"2001","journal-title":"Comput. Networks"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB4","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"Dyachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB5","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"Dyachkov","year":"1989","journal-title":"Problems Control Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00191355","article-title":"On key storage in secure networks","volume":"8","author":"Dyer","year":"1995","journal-title":"J. Cryptol."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1017\/S0963548300002121","article-title":"Interval packing and covering in the boolean lattice","volume":"5","author":"Engel","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0097-3165(82)90004-8","article-title":"Families of finite sets in which no set is covered by the union of two others","volume":"33","author":"Erd\u00f6s","year":"1982","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f6s","year":"1985","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB10","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/jcta.1996.0012","article-title":"On r-cover-free families","volume":"73","author":"F\u00fcredi","year":"1996","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB11","doi-asserted-by":"crossref","unstructured":"J.A. Garay, J. Staddon, A. Wool, Long-lived broadcast encryption, in Advances in Cryptology\u2013Crypto 2000, Lecture Notes in Computer Science, Vol. 1880, Springer, Berlin, 2000, pp. 333\u2013352.","DOI":"10.1007\/3-540-44598-6_21"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB12","first-page":"257","article-title":"Non-adaptive hypergeometric group testing","volume":"22","author":"Hwang","year":"1987","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB14","series-title":"The Art of Computer Programming","author":"Knuth","year":"1997"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB15","doi-asserted-by":"crossref","unstructured":"R. Kumar, S. Rajagopalan, A. Sahai, Coding constructions for blacklisting problems without computational assumptions, In Advances in Cryptology\u2013Crypto \u201999, Lecture Notes in Computer Science, Vol. 1666, Springer, Berlin, 1999, pp. 609\u2013623.","DOI":"10.1007\/3-540-48405-1_38"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB16","unstructured":"X. Ma, An evaluative problem related to a new bound of cover-free family, preprint."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","article-title":"Key storage in secure networks","volume":"21","author":"Mitchell","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB18","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","article-title":"On the upper bound of the size of the r-cover-free families","volume":"66","author":"Ruszink\u00f3","year":"1994","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB19","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1006\/inco.1998.2769","article-title":"Multireceiver authentication codes","volume":"151","author":"Safavi-Naini","year":"1999","journal-title":"Inform. Comput."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1008268610932","article-title":"On some methods for unconditionally secure key distribution and broadcast encryption","volume":"12","author":"Stinson","year":"1997","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1008209004667","article-title":"Some new results on key distribution patterns and broadcast encryption","volume":"14","author":"Stinson","year":"1998","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB22","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","article-title":"Secure frameproof codes, key distribution patterns, group testing algorithms and related structures","volume":"86","author":"Stinson","year":"2000","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480196304246","article-title":"Combinatorial properties and constructions of traceability schemes and frameproof codes","volume":"11","author":"Stinson","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00287-5_BIB24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1006\/jcta.1999.3036","article-title":"Some new bounds for cover-free families","volume":"90","author":"Stinson","year":"2000","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB25","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.2000.3068","article-title":"Explicit constructions of perfect hash families from algebraic curves over finite fields","volume":"93","author":"Wang","year":"2001","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(03)00287-5_BIB26","unstructured":"R. Wei, On cover-free families, preprint."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:23:00Z","timestamp":1550852580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002875"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00287-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}