{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:41:56Z","timestamp":1771854116873,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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":[[1996,8]]},"DOI":"10.1016\/0304-3975(95)00139-5","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"145-160","source":"Crossref","is-referenced-by-count":8,"title":["A three-word code which is not prefix-suffix composed"],"prefix":"10.1016","volume":"163","author":[{"given":"Denis","family":"Derencourt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00139-5_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(95)00139-5_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0021-8693(79)90113-3","article-title":"Sur le th\u00e9or\u00e8me du d\u00e9faut","volume":"60","author":"Berstel","year":"1979","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(95)00139-5_BIB3","first-page":"105","article-title":"Une famille remarquable de codes ind\u00e9composables","author":"Bo\u00eb","year":"1978"},{"key":"10.1016\/0304-3975(95)00139-5_BIB4","first-page":"342","article-title":"Sur l'application du th\u00e9or\u00e8me de Suschkevitch \u00e0 l'\u00e9tude des codes rationnels complets","author":"C\u00e9sari","year":"1974"},{"key":"10.1016\/0304-3975(95)00139-5_BIB5","article-title":"Construction et compl\u00e9tion de codes finis","author":"De Felice","year":"1985","journal-title":"Th\u00e8se de 3\u00e8me cycle, Rapport LITP 85-3"},{"key":"10.1016\/0304-3975(95)00139-5_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","article-title":"On codes having no finite completion","volume":"17","author":"Restivo","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(95)00139-5_BIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1051\/ita\/1989230201351","article-title":"Completing codes","volume":"23","author":"Restivo","year":"1989","journal-title":"RAIRO Theoret. Inform. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:29:01Z","timestamp":1556314141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397595001395"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00139-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}