{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:41Z","timestamp":1725663701929},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_182","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:52Z","timestamp":1330262452000},"page":"691-698","source":"Crossref","is-referenced-by-count":3,"title":["On codes having no finite completion"],"prefix":"10.1007","author":[{"given":"Nguyen Huong","family":"Lam","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"56_CR1","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"J. Berstel, D. Perrin: Theory of Codes. New York: Academic Press 1985"},{"key":"56_CR2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","volume":"11","author":"V. Bruy\u00e8re","year":"1990","unstructured":"V. Bruy\u00e8re, Limin Wang, Liang Zhang: On Completion of Codes with Finite Deciphering Delay. European Journal of Combinatorics 11, 513\u2013521 (1990)","journal-title":"European Journal of Combinatorics"},{"key":"56_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(89)90076-5","volume":"63","author":"C. Felice De","year":"1989","unstructured":"C. De Felice: Construction of a Family of Finite Maximal Codes. Theoretical Computer Science 63, 157\u2013184 (1989)","journal-title":"Theoretical Computer Science"},{"key":"56_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1051\/ita\/1985190403831","volume":"19","author":"C. Felice De","year":"1985","unstructured":"C. De Felice, A. Restivo: Some Results On Finite Maximal Codes. RAIRO Informatique th\u00e9orique 19, 383\u2013403 (1985)","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"56_CR5","first-page":"89","volume":"20","author":"A. Ehrenfeucht","year":"1986","unstructured":"A. Ehrenfeucht, G. Rozenberg: Each Regular Code Is Included In a Regular Maximal Code. RAIRO Informatique th\u00e9orique 20, 89\u201396 (1986)","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"56_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02021311","volume":"1","author":"G. Haj\u00f3s","year":"1950","unstructured":"G. Haj\u00f3s: Sur le probl\u00e8me de factorisation de groupes cycliques. Acta Mathematica Acad. Sci. Hungaricae 1, 189\u2013195 (1950)","journal-title":"Acta Mathematica Acad. Sci. Hungaricae"},{"key":"56_CR7","volume-title":"Abelian Groups","author":"L. Fuchs","year":"1958","unstructured":"L. Fuchs: Abelian Groups. Budapest: Akad\u00e9miai kiad\u00f3 1958; Oxford-London-New York-Paris: Pergamon Press 1960"},{"key":"56_CR8","first-page":"297","volume":"240","author":"M. Krasner","year":"1937","unstructured":"M. Krasner, B. Ranulac: Sur une propri\u00e9t\u00e9 des polynomes de la division du cercle. Comptes Rendus Acad. Sci. Paris 240, 297\u2013299 (1937)","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"key":"56_CR9","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"G. Lallement: Semigroups and Combinatorial Applications. New York: John Wiley and Sons 1979"},{"issue":"no1","key":"56_CR10","first-page":"87","volume":"1","author":"A. A. Markov","year":"1967","unstructured":"Al. A. Markov: An Example of Independent System of Words Which Cannot Be Included into a Finite Complete System. Matematicheskie Zametki 1, 87\u201390 (1967), no 1 (in Russian)","journal-title":"Matematicheskie Zametki"},{"key":"56_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","volume":"17","author":"A. Restivo","year":"1977","unstructured":"A. Restivo: On Codes Having No Finite Completions. Discrete Mathematics 17, 309\u2013316 (1977)","journal-title":"Discrete Mathematics"},{"key":"56_CR12","first-page":"135","volume":"23","author":"A. Restivo","year":"1989","unstructured":"A. Restivo, S. Salemi, T. Sportelli: Completing Codes. RAIRO Informatique th\u00e9orique 23, 135\u2013147 (1989)","journal-title":"RAIRO Informatique th\u00e9orique"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_182.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:09Z","timestamp":1619572089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_182","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}