{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:53:20Z","timestamp":1787759600422,"version":"build-2784847793"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801392"],"award-info":[{"award-number":["11801392"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20180833"],"award-info":[{"award-number":["BK20180833"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10623-020-00809-9","type":"journal-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T06:02:47Z","timestamp":1602741767000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved upper bounds for parent-identifying set systems and separable codes"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-8275","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"809_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(90)90002-Y","volume":"83","author":"M Aaltonen","year":"1995","unstructured":"Aaltonen M.: A new upper bound on nonbinary block codes. Discret. Math. 83, 139\u2013160 (1995).","journal-title":"Discret. Math."},{"key":"809_CR2","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":"809_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"JA Bondy","year":"1974","unstructured":"Bondy J.A., Simonovits M.: Cycles of even length in graphs. J. Comb. Theory Ser. B 16, 97\u2013105 (1974).","journal-title":"J. Comb. Theory Ser. B"},{"key":"809_CR4","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":"809_CR5","doi-asserted-by":"crossref","unstructured":"Chor B., Fiat A., Naor M.: Tracing traitors. In: Cryto\u201994, pp. 480\u2013491. Springer, Berlin, Heigelberg, New York (1994).","DOI":"10.1007\/3-540-48658-5_25"},{"key":"809_CR6","doi-asserted-by":"publisher","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. Inf. Theory 46, 893\u2013910 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/jcta.2000.3127","volume":"94","author":"G Cohen","year":"2001","unstructured":"Cohen G., Litsyn S., Z\u00e9mor G.: Binary $$B_2$$-sequences: a new upper bound. J. Comb. Theory Ser. A 94, 152\u2013155 (2001).","journal-title":"J. Comb. Theory Ser. A"},{"key":"809_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-008-9253-z","volume":"51","author":"MJ Collins","year":"2009","unstructured":"Collins M.J.: Upper bounds for parent-identifying set systems. Des. Codes Cryptogr. 51, 167\u2013173 (2009).","journal-title":"Des. Codes Cryptogr."},{"key":"809_CR9","first-page":"1","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, 1\u201397 (1973).","journal-title":"Philips Res. Rep. Suppl."},{"key":"809_CR10","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. Inf. Theory 64, 3450\u20133460 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR11","unstructured":"Gu Y., Satake S.: On 2-parent-identifying set systems of block size 4. arXiv:1908.03523v2."},{"key":"809_CR12","doi-asserted-by":"publisher","first-page":"6160","DOI":"10.1109\/TIT.2019.2927020","volume":"65","author":"Y Gu","year":"2019","unstructured":"Gu Y., Cheng M., Kabatiansky G., Miao Y.: Probabilistic existence results for parent-identifying schemes. IEEE Trans. Inf. Theory 65, 6160\u20136170 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/LCOMM.2019.2945948","volume":"24","author":"Y Gu","year":"2020","unstructured":"Gu Y., Fan J., Miao Y.: Improved bounds for separable codes and $$B_2$$ codes. IEEE Commun. Lett. 24, 15\u201319 (2020).","journal-title":"IEEE Commun. Lett."},{"key":"809_CR14","first-page":"43","volume":"40","author":"VI Levenshtein","year":"1983","unstructured":"Levenshtein V.I.: Bounds for packings of metric spaces and some applications. Probl. Pered. Inf. 40, 43\u2013110 (1983). (in Russian).","journal-title":"Probl. Pered. Inf."},{"key":"809_CR15","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/S0021-9800(69)80038-4","volume":"6","author":"B Lindstr\u00f6m","year":"1969","unstructured":"Lindstr\u00f6m B.: Determination of two vectors from the sum. J. Comb. Theory 6, 402\u2013407 (1969).","journal-title":"J. Comb. Theory"},{"key":"809_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0022-314X(72)90052-2","volume":"4","author":"B Lindstr\u00f6m","year":"1972","unstructured":"Lindstr\u00f6m B.: On $$B_2$$-sequence of vectors. J. Number Theory 4, 261\u2013265 (1972).","journal-title":"J. Number Theory"},{"key":"809_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/18.748991","volume":"45","author":"S Litsyn","year":"1999","unstructured":"Litsyn S.: New upper bounds on error exponents. IEEE Trans. Inf. Theory 45, 385\u2013398 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"RJ McEliece","year":"1977","unstructured":"McEliece R.J., Rodemich E.R., Rumsey Jr. H., Welch L.R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory 23, 157\u2013166 (1977).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR19","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BF01455900","volume":"106","author":"S Sidon","year":"1932","unstructured":"Sidon S.: Ein satz \u00fcber trigonometrische polynome und seine anwendung in der theorie der Fourier-Reihen. Math. Ann. 106, 536\u2013539 (1932).","journal-title":"Math. Ann."},{"key":"809_CR20","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 code. SIAM J. Discret. Math. 11, 41\u201353 (1998).","journal-title":"SIAM J. Discret. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00809-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00809-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00809-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T08:56:00Z","timestamp":1634288160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00809-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00809-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,15]]},"assertion":[{"value":"25 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}