{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:16Z","timestamp":1772283616915,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00437-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"75-83","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"title":["Intersecting codes and separating codes"],"prefix":"10.1016","volume":"128","author":[{"given":"G","family":"Cohnen","sequence":"first","affiliation":[]},{"given":"S","family":"Encheva","sequence":"additional","affiliation":[]},{"given":"S","family":"Litsyn","sequence":"additional","affiliation":[]},{"given":"H.G","family":"Schaathun","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00437-7_BIB1","doi-asserted-by":"crossref","unstructured":"A. Barg, G.R. Blakeley, G. Kabatiansky, Good digital fingerprinting codes, Proceedings IEEE ISIT, Washington, DC, 2001, p. 161.","DOI":"10.1109\/ISIT.2001.936024"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/S0895480100376848","article-title":"A hypergraph approach to the identifying parent property","volume":"14","author":"Barg","year":"2001","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB3","doi-asserted-by":"crossref","unstructured":"D. Boneh, J. Shaw, Collusion-secure fingerprinting for digital data, Springer Lecture Notes in Computer Science, Vol. 963, Springer, Berlin, 1995, p. 452.","DOI":"10.1007\/3-540-44750-4_36"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB4","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TC.1980.1675640","article-title":"Separating and completely separating systems and linear codes","volume":"29","author":"Bose","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB5","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Fiat, M. Naor, Tracing traitors, Springer Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, 1994, p. 257.","DOI":"10.1007\/3-540-48658-5_25"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB6","unstructured":"G. Cohen, S. Encheva, H.-G. Schaathun, More on (2,2)-separating systems, IEEE Trans. Inform. Theory, in print."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB7","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/18.340462","article-title":"Intersecting codes and independent families","volume":"40","author":"Cohen","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB8","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/T-C.1969.222707","article-title":"Universal single transition time asynchronous state assignments","volume":"18","author":"Friedman","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jcta.1997.2851","article-title":"On codes with the identifiable parent property","volume":"82","author":"Hollmann","year":"1998","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/0401035","article-title":"Separating partition systems and locally different sequences","volume":"1","author":"K\u00f6rner","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB11","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB12","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TC.1976.1674720","article-title":"Techniques to construct (2,1) separating systems from linear error-correcting codes","volume":"25","author":"Pradhan","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB13","unstructured":"E.M. Rains, N.J.A. Sloane, Self-dual codes, in: Handbook of Coding Theory, North-Holland, Amsterdam, 1998, p. 177."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB14","unstructured":"Yu.L. Sagalovich, State Encoding and Reliability of Automata, Svyaz\u2019, Moscow, 1975 (in Russian)."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB15","first-page":"105","article-title":"Separating systems","volume":"30","author":"Sagalovich","year":"1994","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0166-218X(02)00437-7_BIB16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480196304246","article-title":"Combinatorial properties and constructions of traceability schemes and frameproof codes","volume":"11","author":"Stinson","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00437-7_BIB17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(91)90120-L","article-title":"Algebraic\u2013geometric codes and asymptotic problems","volume":"33","author":"Tsfasmann","year":"1991","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:59Z","timestamp":1759060619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004377"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00437-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Intersecting codes and separating codes","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(02)00437-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}