{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:46Z","timestamp":1760202646110},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_25","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"224-235","source":"Crossref","is-referenced-by-count":11,"title":["Multiset, Set and Numerically Decipherable Codes over Directed Figures"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Kolarz","sequence":"first","affiliation":[]},{"given":"W\u0142odzimierz","family":"Moczurad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)00201-S","volume":"147","author":"P. Aigrain","year":"1995","unstructured":"Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoretical Computer Science\u00a0147(1-2), 165\u2013180 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0304-3975(03)00029-X","volume":"303","author":"D. Beauquier","year":"2003","unstructured":"Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoretical Computer Science\u00a0303(2-3), 417\u2013430 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/18.930915","volume":"47","author":"F. Blanchet-Sadri","year":"2001","unstructured":"Blanchet-Sadri, F.: On unique, multiset, set decipherability of three-word codes. IEEE Transactions on Information Theory\u00a047(5), 1745\u20131757 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10-11","key":"25_CR4","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(10-11), 1257\u20131262 (2001)","journal-title":"Computers and Mathematics with Applications"},{"issue":"2","key":"25_CR5","first-page":"227","volume":"9","author":"F. Burderi","year":"2007","unstructured":"Burderi, F., Restivo, A.: Coding partitions. Discrete Mathematics and Theoretical Computer Science\u00a09(2), 227\u2013240 (2007)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00224-006-1320-0","volume":"40","author":"F. Burderi","year":"2007","unstructured":"Burderi, F., Restivo, A.: Varieties of codes and kraft inequality. Theory of Computing Systems\u00a040(4), 507\u2013520 (2007)","journal-title":"Theory of Computing Systems"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2005.03.028","volume":"337","author":"G. Costagliola","year":"2005","unstructured":"Costagliola, G., Ferrucci, F., Gravino, C.: Adding symbolic information to picture models: definitions and properties. Theoretical Computer Science\u00a0337, 51\u2013104 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"25_CR8","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-1996-253411","volume":"25","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae\u00a025(3), 399\u2013422 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"25_CR9","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(1), 13\u201335 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/3-540-58338-6_108","volume-title":"Mathematical Foundations of Computer Science 1994","author":"T. Head","year":"1994","unstructured":"Head, T., Weber, A.: The Finest Homophonic Partition and Related Code Concepts. In: Privara, I., Ru\u017ei\u010dka, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol.\u00a0841, pp. 618\u2013628. Springer, Heidelberg (1994)"},{"issue":"1","key":"25_CR11","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 Transactions on Information Theory\u00a041(1), 291\u2013297 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1051\/ita\/2011005","volume":"44","author":"M. Kolarz","year":"2010","unstructured":"Kolarz, M.: The code problem for directed figures. Theoretical Informatics and Applications RAIRO\u00a044(4), 489\u2013506 (2010)","journal-title":"Theoretical Informatics and Applications RAIRO"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-14031-0_56","volume-title":"Computing and Combinatorics","author":"M. Kolarz","year":"2010","unstructured":"Kolarz, M.: Directed Figure Codes: Decidability Frontier. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 530\u2013539. Springer, Heidelberg (2010)"},{"issue":"2","key":"25_CR14","first-page":"1","volume":"11","author":"M. Kolarz","year":"2009","unstructured":"Kolarz, M., Moczurad, W.: Directed figure codes are decidable. Discrete Mathematics and Theoretical Computer Science\u00a011(2), 1\u201314 (2009)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"5","key":"25_CR15","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 Transactions on Information Theory\u00a032(5), 714\u2013716 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0304-3975(99)00317-5","volume":"255","author":"S. Mantaci","year":"2001","unstructured":"Mantaci, S., Restivo, A.: Codes and equations on trees. Theoretical Computer Science\u00a0255, 483\u2013509 (2001)","journal-title":"Theoretical Computer Science"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/00207160008804929","volume":"74","author":"W. Moczurad","year":"2000","unstructured":"Moczurad, W.: Brick codes: families, properties, relations. International Journal of Computer Mathematics\u00a074, 133\u2013150 (2000)","journal-title":"International Journal of Computer Mathematics"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-15381-5_30","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2010","author":"W. Moczurad","year":"2010","unstructured":"Moczurad, W.: Directed Figure Codes with Weak Equality. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol.\u00a06283, pp. 242\u2013250. Springer, Heidelberg (2010)"},{"issue":"3","key":"25_CR19","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 Transactions on Information Theory\u00a035(3), 662\u2013663 (1989)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"25_CR20","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1016\/j.ic.2009.03.004","volume":"207","author":"A. Salomaa","year":"2009","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: Variants of codes and indecomposable languages. Information and Computation\u00a0207(11), 1340\u20131349 (2009)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:51Z","timestamp":1620135231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}