{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T14:33:05Z","timestamp":1759588385916},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1965,8,1]],"date-time":"1965-08-01T00:00:00Z","timestamp":-139449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":17819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1965,8]]},"DOI":"10.1016\/s0019-9958(65)90300-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"355-372","source":"Crossref","is-referenced-by-count":65,"title":["Codes with bounded synchronization delay"],"prefix":"10.1016","volume":"8","author":[{"given":"Solomon W.","family":"Golomb","sequence":"first","affiliation":[]},{"given":"Basil","family":"Gordon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(65)90300-1_bib1","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","article-title":"Variable length binary encodings","volume":"38","author":"Gilbert","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0019-9958(65)90300-1_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."},{"issue":"No. 9","key":"10.1016\/S0019-9958(65)90300-1_bib3","article-title":"Construction and properties of comma-free codes","volume":"23","author":"Golomb","year":"1958","journal-title":"Biol. Medd. Dan. Vid. Selsk."},{"key":"10.1016\/S0019-9958(65)90300-1_bib4","doi-asserted-by":"crossref","first-page":"178","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\/S0019-9958(65)90300-1_bib5","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TIT.1962.1057787","article-title":"Path-invariant comma-free codes","volume":"IT-8","author":"Kendall","year":"1962","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0019-9958(65)90300-1_bib6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/TIT.1956.1056818","article-title":"Two inequalities implied by unique decipherability","volume":"2","author":"McMillan","year":"1956","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0019-9958(65)90300-1_bib7","series-title":"Introduction to Number Theory","author":"Nagell","year":"1951"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995865903001?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995865903001?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:26:01Z","timestamp":1548941161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995865903001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1965,8]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1965,8]]}},"alternative-id":["S0019995865903001"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(65)90300-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1965,8]]}}}