{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T04:47:33Z","timestamp":1747975653835,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Guangxi Nature Science Foundation","award":["2016GXNSFFA380011"],"award-info":[{"award-number":["2016GXNSFFA380011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10623-018-0490-5","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T21:39:44Z","timestamp":1525815584000},"page":"97-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved bounds on 2-frameproof codes with length 4"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-0610","authenticated-orcid":false,"given":"Minquan","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Jing","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"key":"490_CR1","unstructured":"Bazrafshan M., van Trung T.: On optimal bounds for separating hash families. In: Germany-Africa Workshop on Information and Communication Technology, Essen, Germany (2008)."},{"key":"490_CR2","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10623-012-9673-7","volume":"69","author":"M Bazrafshan","year":"2013","unstructured":"Bazrafshan M., van Trung T.: Improved bounds for separating hash families. Des. Codes Cryptogr. 69, 369\u2013382 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"490_CR3","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. Discret. Math. 16, 499\u2013510 (2003).","journal-title":"SIAM J. Discret. Math."},{"key":"490_CR4","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1016\/j.jcta.2008.01.009","volume":"115","author":"SR Blackburn","year":"2008","unstructured":"Blackburn S.R., Etzion T., Stinson D.R., Zaverucha G.M.: A bound on the size of separating hash families. J. Comb. Theory A 115, 1246\u20131256 (2008).","journal-title":"J. Comb. Theory A"},{"key":"490_CR5","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. Comb. Theory A 117, 1049\u20131057 (2010).","journal-title":"J. Comb. Theory A"},{"key":"490_CR6","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. Inf. Theory 44, 1897\u20131905 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"490_CR7","doi-asserted-by":"publisher","first-page":"5449","DOI":"10.1109\/TIT.2012.2197812","volume":"58","author":"Y Chee","year":"2012","unstructured":"Chee Y., Zhang X.: Improved constructions of frameproof codes. IEEE Trans. Inf. Theory 58, 5449\u20135453 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"490_CR8","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. Inf. Theory 57, 4843\u20134851 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"490_CR9","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1109\/TIT.2011.2174614","volume":"58","author":"M Cheng","year":"2012","unstructured":"Cheng M., Ji L., Miao Y.: Separable codes. IEEE Trans. Inf. Theory 58, 1791\u20131803 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"490_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10623-013-9849-9","volume":"74","author":"M Cheng","year":"2015","unstructured":"Cheng M., Fu H.-L., Jiang J., Lo Y.-H., Miao Y.: New bounds on $\\overline{2}$-separable codes of length $2$. Des. Codes Cryptogr. 74, 31\u201340 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"490_CR11","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, 301\u2013319 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"490_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"HDL Hollmann","year":"1998","unstructured":"Hollmann H.D.L., Lint J.H., Linnartz J.-P., Tolhuizen L.M.G.M.: On codes with the identifiable parent property. J. Comb. Theory A 82, 121\u2013133 (1998).","journal-title":"J. Comb. Theory A"},{"key":"490_CR13","volume-title":"Data Structures and Algorithms. 1. Sorting and Searching","author":"K Mehlhorn","year":"1984","unstructured":"Mehlhorn K.: Data Structures and Algorithms. 1. Sorting and Searching. Springer, Berlin (1984)."},{"key":"490_CR14","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. Inf. Theory 63, 7247\u20137252 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"490_CR15","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. Inf. Theory 47, 1042\u20131049 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"490_CR16","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. Discret. Math. 11, 41\u201353 (1998).","journal-title":"SIAM J. Discret. Math."},{"key":"490_CR17","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, 595\u2013617 (2000).","journal-title":"J. Stat. Plan. Inference"},{"key":"490_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jcta.2007.04.005","volume":"115","author":"DR Stinson","year":"2008","unstructured":"Stinson D.R., Wei R., Chen K.: On generalized separating hash families. J. Comb. Theory A 115, 105\u2013120 (2008).","journal-title":"J. Comb. Theory A"},{"key":"490_CR19","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10623-013-9800-0","volume":"72","author":"T Trung van","year":"2014","unstructured":"van Trung T.: A tight bound for frameproof codes viewed in terms of separating hash families. Des. Codes Cryptogr. 72, 713\u2013718 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"490_CR20","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. Inf. Theory 48, 2991\u20132995 (2002).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0490-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0490-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0490-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T19:18:20Z","timestamp":1557343100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0490-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["490"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0490-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"6 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}