{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:18:07Z","timestamp":1775053087178,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212584","type":"print"},{"value":"9783540246985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_36","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"322-328","source":"Crossref","is-referenced-by-count":4,"title":["Separating Codes: Constructions and Bounds"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans Georg","family":"Schaathun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"480","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. on Inf. Theory\u00a044, 480\u2013491 (1998)","journal-title":"IEEE Trans. on Inf. Theory"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0401035","volume":"1","author":"J. K\u00f6rner","year":"1988","unstructured":"K\u00f6rner, J., Simonyi, G.: Separating partition systems and locally different sequences. SIAM J. Discrete Math.\u00a01(3), 355\u2013359 (1988)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"36_CR3","first-page":"105","volume":"30","author":"Y.L. Sagalovich","year":"1994","unstructured":"Sagalovich, Y.L.: Separating systems. Probl. Inform. Trans.\u00a030(2), 105\u2013123 (1994)","journal-title":"Probl. Inform. Trans."},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A. Barg","year":"2001","unstructured":"Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Z\u00e9mor, G.: A hypergraph approach to the identifying parent property. SIAM J. Disc. Math.\u00a014(3), 423\u2013431 (2001)","journal-title":"SIAM J. Disc. Math."},{"issue":"9","key":"36_CR5","doi-asserted-by":"publisher","first-page":"2606","DOI":"10.1109\/TIT.2002.801479","volume":"48","author":"G. Cohen","year":"2002","unstructured":"Cohen, G., Encheva, S., Schaathun, H.G.: More on (2, 2)-separating systems. IEEE Trans. Inform. Theory\u00a048(9), 2606\u20132609 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A. D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov, A., Vilenkin, P., Macula, A., Torney, D.: Families of finite sets in which no intersection of \u2113 sets is covered by the union of s others. J. Combinatorial Theory\u00a099, 195\u2013208 (2002)","journal-title":"J. Combinatorial Theory"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0166-218X(91)90120-L","volume":"33","author":"M.A. Tsfasmann","year":"1991","unstructured":"Tsfasmann, M.A.: Algebraic-geometric codes and asymptotic problems. Discrete Applied Math.\u00a033, 241\u2013256 (1991)","journal-title":"Discrete Applied Math."},{"key":"36_CR8","unstructured":"Krasnopeev, A., Sagalovitch, Y.: The Kerdock codes and separating systems. In: Eighth International Workshop on Algebraic and Combinatorial Theory, September 8-14, pp. 165\u2013167 (2002)"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 609\u2013623. Springer, Heidelberg (1999)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2002.804111","volume":"40","author":"C. Xing","year":"2002","unstructured":"Xing, C.: Asymptotic bounds on frameproof codes. IEEE Trans. Inform. Th.\u00a040, 2991\u20132995 (2002)","journal-title":"IEEE Trans. Inform. Th."},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44598-6_21","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J. Garay","year":"2000","unstructured":"Garay, J., Staddon, J., Wool, A.: Long-lived broadcast encryption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 333\u2013352. Springer, Heidelberg (2000)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480101384633","volume":"16","author":"S.R. Blackburn","year":"2003","unstructured":"Blackburn, S.R.: Frameproof codes. SIAM J. Discrete Math.\u00a016, 499\u2013510 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, G., Schaathun, H.-G.: New upper bounds on separating codes. In: 2003 International Conference on Telecommunications (February 2003)","DOI":"10.1109\/ICTEL.2003.1191621"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T12:05:33Z","timestamp":1553342733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}