{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:29:10Z","timestamp":1753885750141},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00280-2","type":"journal-article","created":{"date-parts":[[2004,1,27]],"date-time":"2004-01-27T10:22:43Z","timestamp":1075198963000},"page":"355-368","source":"Crossref","is-referenced-by-count":3,"title":["Splitting systems and separating systems"],"prefix":"10.1016","volume":"279","author":[{"given":"Alan C.H.","family":"Ling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.C.","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.H.J.","family":"van Rees","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0012-365X(03)00280-2_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0605009","article-title":"On the size of separating systems and families of perfect hash functions","volume":"5","author":"Fredman","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"6","key":"10.1016\/S0012-365X(03)00280-2_BIB2","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/T-C.1969.222707","article-title":"Universal single transition time asynchronous state assignments","volume":"C-18","author":"Friedman","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(03)00280-2_BIB3","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0012-365X(03)00280-2_BIB4","first-page":"75","article-title":"On random generating elements of a finite Boolean algebra","volume":"22","author":"R\u00e9nyi","year":"1961","journal-title":"Acta Sci. Math. Szeged"},{"key":"10.1016\/S0012-365X(03)00280-2_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","article-title":"Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem","volume":"71","author":"Stinson","year":"2002","journal-title":"Math. Comput."},{"key":"10.1016\/S0012-365X(03)00280-2_BIB6","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":"86","author":"Stinson","year":"2000","journal-title":"J. Statist. Plann. Inference"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002802?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002802?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T11:24:48Z","timestamp":1550229888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002802"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00280-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}