{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:23Z","timestamp":1725548963043},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_45","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"545-556","source":"Crossref","is-referenced-by-count":0,"title":["Varieties of Codes and Kraft Inequality"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Burderi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","volume-title":"The Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: The Theory of Codes. Academic Press, New York (1985)"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1016\/S0898-1221(01)00096-7","volume":"41","author":"F. Blanchet-Sadri","year":"2001","unstructured":"Blanchet-Sadri, F., Morgan, C.: Multiset and set decipherable codes. Computers and Mathematics with Applications\u00a041, 1257\u20131262 (2001)","journal-title":"Computers and Mathematics with Applications"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(80)90062-6","volume":"12","author":"J.M. Boe","year":"1980","unstructured":"Boe, J.M., De Luca, A., Restivo, A.: Minimal complete sets of words. Theoretical Computer Science\u00a012, 325\u2013332 (1980)","journal-title":"Theoretical Computer Science"},{"key":"45_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S. Burris","year":"1981","unstructured":"Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, New York (1981)"},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","volume":"20","author":"A. Ehrefeucht","year":"1986","unstructured":"Ehrefeucht, A., Rozenberg, G.: Each regular code is included in a maximal regular code. RAIRO Inform. Theor. Appl.\u00a020, 89\u201396 (1986)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"45_CR6","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0022-4049(98)00019-X","volume":"141","author":"F. Guzm\u00e1n","year":"1999","unstructured":"Guzm\u00e1n, F.: Decipherability of codes. Journal of Pure and Applied Algebra\u00a0141, 13\u201335 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/18.370097","volume":"41","author":"T. Head","year":"1995","unstructured":"Head, T., Weber, A.: Deciding multiset decipherability. IEEE Trans. Inform. Theory\u00a041, 291\u2013297 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TIT.1986.1057217","volume":"32","author":"A. Lempel","year":"1986","unstructured":"Lempel, A.: On multiset decipherable codes. IEEE Trans. Inform. Theory\u00a032, 714\u2013716 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"45_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/18.30991","volume":"35","author":"A. Restivo","year":"1989","unstructured":"Restivo, A.: A note on multiset decipherable code. IEEE Trans. Inform. Theory\u00a035, 662\u2013663 (1989)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:52Z","timestamp":1605742192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}