{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T17:10:23Z","timestamp":1767892223558,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"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":[[1989,2]]},"DOI":"10.1016\/0304-3975(89)90076-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"157-184","source":"Crossref","is-referenced-by-count":22,"title":["Construction of a family of finite maximal codes"],"prefix":"10.1016","volume":"63","author":[{"given":"Clelia","family":"De Felice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90076-5_bib1","series-title":"The Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(89)90076-5_bib2","first-page":"85","article-title":"Trends in the theory of codes","author":"Berstel","year":"1986","journal-title":"Bull. EATCS No. 29"},{"key":"10.1016\/0304-3975(89)90076-5_bib3","article-title":"Rational Series and their Languages","volume":"12","author":"Berstel","year":"1988"},{"key":"10.1016\/0304-3975(89)90076-5_bib4","series-title":"Noncommutative Structures in Algebra and Geometric Combinatorics","first-page":"7","article-title":"Sur les codes synchronisants coupants","author":"Bo\u00eb","year":"1978"},{"key":"10.1016\/0304-3975(89)90076-5_bib5","series-title":"Th\u00e9orie des Codes, Actes de la Septi\u00e8me\u00c9cole de Printemps D'Informatique Th\u00e9orique","first-page":"1","article-title":"Sur les codes factorisants","author":"Bo\u00eb","year":"1979"},{"key":"10.1016\/0304-3975(89)90076-5_bib6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1051\/ita\/1985190403831","article-title":"Some results on finite maximal codes","volume":"19","author":"De Felice","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(89)90076-5_bib7","first-page":"169","article-title":"Solution partielle de la conjecture de factorisation des codes","volume":"302","author":"De Felice","year":"1986","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0304-3975(89)90076-5_bib8","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(89)90076-5_bib9","series-title":"Abelian Groups","author":"Fuchs","year":"1960"},{"key":"10.1016\/0304-3975(89)90076-5_bib10","first-page":"397","article-title":"Sur une propri\u00e9t\u00e9des polyno\u02c6mes de la division du cercle","volume":"240","author":"Krasner","year":"1937","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0304-3975(89)90076-5_bib11","article-title":"Un probl\u00e9me\u00e9l\u00e9mentaire de la th\u00e9orie de l'information","author":"Perrin","year":"1977","journal-title":"Colloques Internationaux du CNRS No. 276"},{"key":"10.1016\/0304-3975(89)90076-5_bib12","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(89)90076-5_bib13","series-title":"Report, Dip. Mat.","article-title":"Completing codes","author":"Restivo","year":"1986"},{"key":"10.1016\/0304-3975(89)90076-5_bib14","first-page":"115","article-title":"Sulla fattorizzazione dei codici","volume":"XXXII","author":"Reutenauer","year":"1983","journal-title":"Ricerche Mat."},{"key":"10.1016\/0304-3975(89)90076-5_bib15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0022-4049(85)90069-6","article-title":"Noncommutative factorization of variable-length codes","volume":"36","author":"Reutenauer","year":"1985","journal-title":"J.P. Appl. Algebra"},{"key":"10.1016\/0304-3975(89)90076-5_bib16","unstructured":"C. Reutenauer, Private communication, 1986."},{"key":"10.1016\/0304-3975(89)90076-5_bib17","unstructured":"S. Salemi, Private communication, 1987."},{"key":"10.1016\/0304-3975(89)90076-5_bib18","article-title":"Une th\u00e9orie alg\u00e9brique du codage","author":"Sch\u00fctzenberger","year":"1955","journal-title":"S\u00e9minaire Dubreil-Pisot"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:15Z","timestamp":1555127715000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0304397589900765"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90076-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}