{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:09:54Z","timestamp":1757617794508,"version":"3.44.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T00:00:00Z","timestamp":1744934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T00:00:00Z","timestamp":1744934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10623-025-01631-x","type":"journal-article","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T11:58:41Z","timestamp":1744977521000},"page":"3069-3082","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New upper bounds for wide-sense frameproof codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Chengyu","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,18]]},"reference":[{"key":"1631_CR1","volume-title":"Combinatorics of Finite Sets","author":"I Anderson","year":"1987","unstructured":"Anderson I.: Combinatorics of Finite Sets. The Clarendon Press, Oxford University Press, New York (1987)."},{"issue":"4","key":"1631_CR2","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A Barg","year":"2003","unstructured":"Barg A., Blakley G.R., Kabatiansky G.A.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory 49(4), 852\u2013865 (2003).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1631_CR3","first-page":"43","volume":"307","author":"SR Blackburn","year":"2003","unstructured":"Blackburn S.R.: Combinatorial schemes for protecting digital content. Surv. Combin. 307, 43\u201378 (2003).","journal-title":"Surv. Combin."},{"issue":"3","key":"1631_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480101384633","volume":"16","author":"SR Blackburn","year":"2003","unstructured":"Blackburn S.R.: Frameproof codes. SIAM J. Discrete Math. 16(3), 499\u2013510 (2003).","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"1631_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0097-3165(03)00030-X","volume":"102","author":"SR Blackburn","year":"2003","unstructured":"Blackburn S.R.: An upper bound on the size of a code with the $$k$$-identifiable parent property. J. Combin. Theory Ser. A 102(1), 179\u2013185 (2003).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"8","key":"1631_CR6","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.jcta.2010.02.009","volume":"117","author":"SR Blackburn","year":"2010","unstructured":"Blackburn S.R., Etzion T., Ng S.: Traceability codes. J. Combin. Theory Ser. A 117(8), 1049\u20131057 (2010).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"5","key":"1631_CR7","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D Boneh","year":"1998","unstructured":"Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory 44(5), 1897\u20131905 (1998).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"1631_CR8","doi-asserted-by":"publisher","first-page":"5449","DOI":"10.1109\/TIT.2012.2197812","volume":"58","author":"YM Chee","year":"2012","unstructured":"Chee Y.M., Zhang X.: Improved constructions of frameproof codes. IEEE Trans. Inform. Theory 58(8), 5449\u20135453 (2012).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"1631_CR9","doi-asserted-by":"publisher","first-page":"4843","DOI":"10.1109\/TIT.2011.2146130","volume":"57","author":"M Cheng","year":"2011","unstructured":"Cheng M., Miao Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE Trans. Inform. Theory 57(7), 4843\u20134851 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1631_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A Dyachkov","year":"2002","unstructured":"Dyachkov A., Vilenkin P., Macula A., Torney D.: Families of finite sets in which no intersection of $$l$$ sets is covered by the union of $$s$$ others. J. Combin. Theory Ser. A 99(2), 195\u2013218 (2002).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"12","key":"1631_CR11","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"2","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P., Ko C., Rado R.: Intersection theorems for systems of finite sets. Quart. J. Math. Oxford Ser. 2(12), 313\u2013320 (1961).","journal-title":"Quart. J. Math. Oxford Ser."},{"issue":"5","key":"1631_CR12","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1109\/TIT.2017.2766659","volume":"64","author":"Y Gu","year":"2018","unstructured":"Gu Y., Miao Y.: Bounds on traceability schemes. IEEE Trans. Inform. Theory 64(5), 3450\u20133460 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2\u20133","key":"1631_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10623-015-0037-y","volume":"77","author":"C Guo","year":"2015","unstructured":"Guo C., Stinson D.R., van Trung T.: On tight bounds for binary frameproof codes. Des. Codes Cryptogr. 77(2\u20133), 301\u2013319 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1631_CR14","first-page":"198","volume":"9","author":"WH Kautz","year":"1963","unstructured":"Kautz W.H., Singleton R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory 9(4), 198\u2013205 (1963).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1631_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","volume":"1","author":"D Lubell","year":"1966","unstructured":"Lubell D.: A short proof of Sperner\u2019s lemma. J. Combin. Theory 1, 299 (1966).","journal-title":"J. Combin. Theory"},{"key":"1631_CR16","volume-title":"Wide-Sense Fingerprinting Codes and Honeycomb Arrays","author":"A Panoui","year":"2012","unstructured":"Panoui A.: Wide-Sense Fingerprinting Codes and Honeycomb Arrays. University of London, Royal Holloway (2012)."},{"issue":"3","key":"1631_CR17","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/19M1248108","volume":"34","author":"C Shangguan","year":"2020","unstructured":"Shangguan C., Tamo I.: Sparse hypergraphs with applications to coding theory. SIAM J. Discrete Math. 34(3), 1493\u20131504 (2020).","journal-title":"SIAM J. Discrete Math."},{"issue":"11","key":"1631_CR18","doi-asserted-by":"publisher","first-page":"7247","DOI":"10.1109\/TIT.2017.2745619","volume":"63","author":"C Shangguan","year":"2017","unstructured":"Shangguan C., Wang X., Ge G., Miao Y.: New bounds for frameproof codes. IEEE Trans. Inform. Theory 63(11), 7247\u20137252 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"1631_CR19","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1007\/s10623-017-0420-y","volume":"86","author":"C Shangguan","year":"2018","unstructured":"Shangguan C., Ma J., Ge G.: New upper bounds for parent-identifying codes and traceability codes. Des. Codes Cryptogr. 86(8), 1727\u20131737 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1631_CR20","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner E.: Ein Satz \u00fcber Untermengen einer endlichen Menge. Math. Z. 27, 544\u2013548 (1928).","journal-title":"Math. Z."},{"issue":"3","key":"1631_CR21","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"JN Staddon","year":"2001","unstructured":"Staddon J.N., 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"},{"issue":"1","key":"1631_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"DR Stinson","year":"1998","unstructured":"Stinson D.R., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11(1), 41\u201353 (1998).","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1631_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","unstructured":"Stinson D.R., van Trung T., Wei R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Inference 86(2), 595\u2013617 (2000).","journal-title":"J. Stat. Plan. Inference"},{"issue":"3","key":"1631_CR24","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10623-013-9800-0","volume":"72","author":"T van Trung","year":"2014","unstructured":"van Trung T.: A tight bound for frameproof codes viewed in terms of separating hash families. Des. Codes Cryptogr. 72(3), 713\u2013718 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"1631_CR25","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2002.804111","volume":"48","author":"C Xing","year":"2002","unstructured":"Xing C.: Asymptotic bounds on frameproof codes. IEEE Trans. Inform. Theory 48(11), 2991\u20132995 (2002).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1631_CR26","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1109\/TIT.2016.2642987","volume":"63","author":"Y Yang","year":"2017","unstructured":"Yang Y., Zhang Y., Ge G.: New lower bounds for secure codes and related hash families: a hypergraph theoretical approach. IEEE Trans. Inform. Theory 63(4), 2446\u20132453 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"1631_CR27","doi-asserted-by":"publisher","first-page":"8636","DOI":"10.1109\/TIT.2024.3411150","volume":"70","author":"Y Zhao","year":"2024","unstructured":"Zhao Y., Zhang X.: Improved upper bounds for wide-sense frameproof codes. IEEE Trans. Inform. Theory 70(12), 8636\u20138646 (2024).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"1631_CR28","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1007\/s10623-020-00797-w","volume":"88","author":"J Zhou","year":"2020","unstructured":"Zhou J., Zhou W.: Wide-sense 2-frameproof codes. Des. Codes Cryptogr. 88(12), 2507\u20132519 (2020).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01631-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01631-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01631-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T11:42:12Z","timestamp":1757158932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01631-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,18]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1631"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01631-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,4,18]]},"assertion":[{"value":"25 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}