{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:55:26Z","timestamp":1767905726524,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90260-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"53-76","source":"Crossref","is-referenced-by-count":13,"title":["Maximal codes with bounded deciphering delay"],"prefix":"10.1016","volume":"84","author":[{"given":"V\u00e8ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90260-9_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(91)90260-9_BIB2","series-title":"Nouvelle Th\u00e8se","article-title":"Codes pr\u00e9fixes, codes \u00e0 d\u00e9lai de d\u00e9chiffrage born\u00e9","author":"Bruy\u00e8re","year":"1989"},{"key":"10.1016\/0304-3975(91)90260-9_BIB3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","article-title":"On completion of codes with finite deciphering delay","volume":"11","author":"Bruy\u00e8re","year":"1990","journal-title":"Europ. J. Combinatorics"},{"key":"10.1016\/0304-3975(91)90260-9_BIB4","series-title":"Th\u00e9orie des Codes","first-page":"47","article-title":"Une caract\u00e9risation des codes \u00e0 d\u00e9lai born\u00e9 par leur fonction de d\u00e9codage","author":"Choffrut","year":"1979"},{"key":"10.1016\/0304-3975(91)90260-9_BIB5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(78)90047-6","article-title":"Elementary homomorphisms and a solution to the DOL sequence equivalence problem","volume":"7","author":"Ehrenfeucht","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90260-9_BIB6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","article-title":"Each regular code is included in a regular maximal code","volume":"20","author":"Ehrenfeucht","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(91)90260-9_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/18.2597","article-title":"Sliding-block coding for input-restricted channels","volume":"34","author":"Karabed","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(91)90260-9_BIB8","author":"Liang","year":"1989","journal-title":"Construction to embed a code with finite deciphering delay into a complete code"},{"key":"10.1016\/0304-3975(91)90260-9_BIB9","series-title":"Automata Theory","first-page":"278","article-title":"El\u00e9ments de la th\u00e9orie des codes","author":"Nivat","year":"1966"},{"key":"10.1016\/0304-3975(91)90260-9_BIB10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BFb0012786","article-title":"Completing biprefix codes","volume":"140","author":"Perrin","year":"1982","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/0304-3975(91)90260-9_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","article-title":"On codes having no finite completions","volume":"17","author":"Restivo","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(91)90260-9_BIB12","first-page":"104","article-title":"A necessary and sufficient condition for the unique decomposition of coded messages","volume":"8","author":"Sardinas","year":"1953","journal-title":"IRE Internat. Conv. Rec."},{"key":"10.1016\/0304-3975(91)90260-9_BIB13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0021-9800(66)80015-7","article-title":"On a question concerning certain free submonoids","volume":"1","author":"Sch\u00fctzenberger","year":"1966","journal-title":"J. Combin. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902609?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902609?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:21Z","timestamp":1555113261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591902609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["0304397591902609"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90260-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}