{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T20:52:00Z","timestamp":1672433520203},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"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":[[1987,1]]},"DOI":"10.1016\/0012-365x(87)90147-6","type":"journal-article","created":{"date-parts":[[2003,2,11]],"date-time":"2003-02-11T20:10:51Z","timestamp":1044994251000},"page":"15-19","source":"Crossref","is-referenced-by-count":4,"title":["A lower bound for 0,1,\u2217 tournament codes"],"prefix":"10.1016","volume":"63","author":[{"given":"Karen L.","family":"Collins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter W.","family":"Shor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John R.","family":"Stembridge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90147-6_BIB1","doi-asserted-by":"crossref","first-page":"202","DOI":"10.4153\/CJM-1958-023-9","article-title":"Comma-free codes","volume":"10","author":"Golomb","year":"1958","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(87)90147-6_BIB2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.4153\/CJM-1963-021-1","article-title":"Recent results in comma-free codes","volume":"15","author":"Jiggs","year":"1963","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(87)90147-6_BIB3","article-title":"Comma-free codes and bounded synchronization delay codes of even word length","author":"Tang","year":"1983"},{"key":"10.1016\/0012-365X(87)90147-6_BIB4","series-title":"Surveys in Combinatorics","first-page":"113","article-title":"{0,1,\u2217}distance problems in combinatorics","author":"van Lint","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:23:17Z","timestamp":1553775797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87901476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0012365X87901476"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90147-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}