{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:54:13Z","timestamp":1648720453945},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1981,1]]},"DOI":"10.1016\/0097-3165(81)90037-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences"],"prefix":"10.1016","volume":"30","author":[{"given":"J.S","family":"Devitt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.M","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(81)90037-6_BIB1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/TIT.1965.1053766","article-title":"On the construction of comma-free codes","author":"Eastman","year":"1965","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0097-3165(81)90037-6_BIB2","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\/0097-3165(81)90037-6_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/sapm1979612141","article-title":"A formal calculus for the enumerative system of sequence. I. Combinatorial theorems","volume":"61","author":"Jackson","year":"1979","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/0097-3165(81)90037-6_BIB4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/TIT.1969.1054292","article-title":"Maximal and variable length comma-free codes","author":"Scholtz","year":"1969","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900376?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:56:48Z","timestamp":1548752208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316581900376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0097316581900376"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(81)90037-6","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}