{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T17:26:07Z","timestamp":1746120367013,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T00:00:00Z","timestamp":1641340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T00:00:00Z","timestamp":1641340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"MINECO","award":["TCO-RISEBLOCK (PID2019-110224RB-I00)","TCO-RISEBLOCK (PID2019-110224RB-I00)"],"award-info":[{"award-number":["TCO-RISEBLOCK (PID2019-110224RB-I00)","TCO-RISEBLOCK (PID2019-110224RB-I00)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that, if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper, further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property.<\/jats:p>","DOI":"10.1007\/s10623-021-00988-z","type":"journal-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T14:03:37Z","timestamp":1641391417000},"page":"427-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A study of the separating property in Reed-Solomon codes by bounding the minimum distance"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7655-135X","authenticated-orcid":false,"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[]},{"given":"Jorge J.","family":"Urroz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,5]]},"reference":[{"key":"988_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0653(04)00151-9","volume":"6","author":"A Barg","year":"2001","unstructured":"Barg A., Cohen G.D., Encheva S.B., Kabatiansky G., Zemor G.: A hypergraph approach to the identifying parent property: the case of multiple parents. Electron. Notes Discret. Math. 6, 1\u20133 (2001).","journal-title":"Electron. Notes Discret. Math."},{"issue":"2\u20133","key":"988_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jco.2003.08.012","volume":"20","author":"A Barg","year":"2004","unstructured":"Barg A., Kabatiansky G.A.: A class of i.p.p. codes with efficient identification. J. Complexity 20(2\u20133), 137\u2013147 (2004).","journal-title":"J. Complexity"},{"issue":"5","key":"988_CR3","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(5), 1897\u20131905 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"988_CR4","first-page":"11","volume":"83","author":"M Cohen","year":"2014","unstructured":"Cohen M., Fu H.-L., Jing J., Yuan-Hsun L., Ying M.: Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83, 11 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"988_CR5","first-page":"480","volume":"839","author":"B Chor","year":"1994","unstructured":"Chor B., Fiat A., Naor M.: Tracing traitors. Adv. Cryptol. Crypto\u201994. LNCS 839, 480\u2013491 (1994).","journal-title":"Adv. Cryptol. Crypto\u201994. LNCS"},{"key":"988_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. Inform. Theory 46, 893\u2013910 (2000).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"988_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00493-012-2819-4","volume":"32","author":"J Cilleruelo","year":"2012","unstructured":"Cilleruelo J.: Combinatorial problems in finite fields and Sidon sets. Combinatorica 32(5), 497\u2013511 (2012).","journal-title":"Combinatorica"},{"key":"988_CR8","doi-asserted-by":"crossref","unstructured":"Cohen G.D., Schaathun H.G.: Separating codes: constructions and bounds. In: LATIN 2004: Theoretical Informatics: 6th Latin American Symposium, Buenos Aires, Argentina, April 5\u20138, 2004. Proceedings, volume 2976, pp. 322\u2013328, April (2004).","DOI":"10.1007\/978-3-540-24698-5_36"},{"issue":"5","key":"988_CR9","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.cose.2009.12.012","volume":"29","author":"M Fernandez","year":"2010","unstructured":"Fernandez M., Cotrina J., Soriano M., Domingo N.: A note about the identifier parent property in Reed-Solomon codes. Comput. Secur. 29(5), 628\u2013635 (2010).","journal-title":"Comput. Secur."},{"issue":"10","key":"988_CR10","doi-asserted-by":"publisher","first-page":"6160","DOI":"10.1109\/TIT.2019.2927020","volume":"65","author":"Y Gu","year":"2019","unstructured":"Gu Y., Minquan C., Grigory K., Ying M.: Probabilistic existence results for parent-identifying schemes. IEEE Trans. Inf. Theory 65(10), 6160\u20136170 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"988_CR11","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., van Lint J.H., Linnartz J.-P., Tolhuizen L.M.G.M.: On codes with the identifiable parent property. J. Comb. Theory 82(2), 121\u2013133 (1998).","journal-title":"J. Comb. Theory"},{"issue":"2","key":"988_CR12","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TIT.2006.889730","volume":"53","author":"J Hongxia","year":"2007","unstructured":"Hongxia J., Mario B.: Combinatorial properties for traceability codes using error correcting codes. IEEE Trans. Inf. Theory 53(2), 804\u2013808 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"988_CR13","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)."},{"issue":"4","key":"988_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.3934\/amc.2012.6.467","volume":"6","author":"K Moreira","year":"2012","unstructured":"Moreira K., Fern\u00e1ndez M., Soriano M.: On the relationship between the traceability properties of Reed-Solomon codes. Adv. Math. Commun. 6(4), 467\u2013478 (2012).","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"988_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-015-0060-z","volume":"80","author":"K Moreira","year":"2016","unstructured":"Moreira K., Fern\u00e1ndez M., Kabatiansky G.: Almost separating and almost secure frameproof codes over q-ary alphabets. Des. Codes Cryptogr. 80(1), 11\u201328 (2016).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"988_CR16","first-page":"105","volume":"30","author":"YL Sagalovich","year":"1994","unstructured":"Sagalovich Y.L.: Separating systems. Problems Inf. Transm. 30(2), 105\u2013123 (1994).","journal-title":"Problems Inf. Transm."},{"issue":"5","key":"988_CR17","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TIT.2003.810630","volume":"49","author":"A Silverberg","year":"2003","unstructured":"Silverberg A., Staddon J., Walker J.L.: Applications of list decoding to tracing traitors. IEEE Trans. Inf. Theory 49(5), 1312\u20131318 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"988_CR18","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(3), 1042\u20131049 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"988_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10623-005-6402-5","volume":"35","author":"T van Trung","year":"2005","unstructured":"van Trung T., Sosina M.: New constructions for ipp codes. Des. Codes Cryptogr. 35(2), 227\u2013239 (2005).","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-021-00988-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00988-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00988-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T18:27:03Z","timestamp":1645727223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00988-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["988"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00988-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,1,5]]},"assertion":[{"value":"22 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}