{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:17Z","timestamp":1775054057329,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T00:00:00Z","timestamp":1228348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s10623-008-9253-z","type":"journal-article","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T15:55:43Z","timestamp":1228319743000},"page":"167-173","source":"Crossref","is-referenced-by-count":18,"title":["Upper bounds for parent-identifying set systems"],"prefix":"10.1007","volume":"51","author":[{"given":"Michael J.","family":"Collins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,4]]},"reference":[{"issue":"6","key":"9253_CR1","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1017\/S0963548304006388","volume":"13","author":"N. Alon","year":"2004","unstructured":"Alon N., Stav U.: New bounds on parent-identifying codes: the case of multiple parents. Comb. Probab. Comput. 13(6), 795\u2013807 (2004)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"9253_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0097-3165(03)00030-X","volume":"102","author":"S.R. Blackburn","year":"2003","unstructured":"Blackburn S.R.: An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory, Ser. A 102(1), 179\u2013185 (2003)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"9253_CR3","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B. Chor","year":"2000","unstructured":"Chor B., Fiat A., Naor M., Pinkas B.: Tracing traitors. IEEE Trans. Inform. Theory 46(3), 893\u2013910 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9253_CR4","unstructured":"Collins M.J.: Upper bounds for set systems with the identifiable parent property. In: Safavi-Naini R. (ed.) ICITS, vol. 5155 of Lecture Notes in Computer Science, pp. 100\u2013106. Springer (2008)."},{"key":"9253_CR5","doi-asserted-by":"crossref","unstructured":"Fernandez M., Navau J.C., Soriano M., Domingo N.: A note about the traceability properties of linear codes. In: Nam K.-H., Rhee G. (eds.) ICISC, vol. 4817 of Lecture Notes in Computer Science, pp. 251\u2013258. Springer (2007).","DOI":"10.1007\/978-3-540-76788-6_20"},{"issue":"1","key":"9253_CR6","first-page":"79","volume":"51","author":"Z. F\u00fcredi","year":"1985","unstructured":"F\u00fcredi Z., Erd\u0151s P., Frankl P.: Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51(1), 79\u201389 (1985)","journal-title":"Israel J. Math."},{"issue":"3","key":"9253_CR7","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J. Staddon","year":"2001","unstructured":"Staddon J., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory 47(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9253_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D.R. Stinson","year":"1998","unstructured":"Stinson D.R., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11, 41\u201353 (1998)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9253-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9253-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9253-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:25Z","timestamp":1559231905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9253-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9253"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9253-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,4]]}}}