{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:19:52Z","timestamp":1775053192163,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00172-6","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"211-219","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Intersecting codes and partially identifying codes"],"prefix":"10.1016","volume":"6","author":[{"given":"G.","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Encheva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0012-365X(90)90002-Y","article-title":"A new upper bound on nonbinary block codes","volume":"83","author":"Aaltonen","year":"1990","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB2","unstructured":"A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, and G. Z\u00e9mor, \u201cA hypergraph approach to the identifying parent property\u201d, submitted to SIAM J. on Disc. Methods."},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB3","first-page":"452","article-title":"Collusion-secure fingerprinting for digital data","volume":"963","author":"Boneh","year":"1995","journal-title":"Springer-Verlag LNCS"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB4","first-page":"257","article-title":"Tracing traitors","volume":"839","author":"Chor","year":"1994","journal-title":"Springer-Verlag LNCS"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB5","series-title":"Handbook of coding theory","first-page":"177","article-title":"Self-dual codes","author":"Rains","year":"1998"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB6","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/18.340462","article-title":"Intersecting codes and independent families","volume":"vol. 40","author":"Cohen","year":"1994","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB7","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\/S1571-0653(04)00172-6_NEWBIB8","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. Th., Series A"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/0401035","article-title":"Separating partition systems and locally different sequences","volume":"vol. 1","author":"K\u00f6rner","year":"1988","journal-title":"SIAM J. Discrete Math"},{"issue":"2","key":"10.1016\/S1571-0653(04)00172-6_NEWBIB10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","article-title":"Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures","volume":"vol. 86","author":"Stinson","year":"2000","journal-title":"J. Stat. Planning and Inference"},{"issue":"2","key":"10.1016\/S1571-0653(04)00172-6_NEWBIB11","first-page":"105","article-title":"Separating systems","volume":"Vol. 30","author":"Sagalovitch","year":"1994","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB12","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\/S1571-0653(04)00172-6_NEWBIB13","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S1571-0653(04)00172-6_NEWBIB14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(91)90120-L","article-title":"Algebraic-geometric codes and asymptotic problems","volume":"vol. 33","author":"Tsfasmann","year":"1991","journal-title":"Discrete Appl. Math"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001726?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001726?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:51:19Z","timestamp":1548597079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":14,"alternative-id":["S1571065304001726"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00172-6","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}