{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:17:48Z","timestamp":1769570268385,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:00:00Z","timestamp":1503014400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s12095-017-0251-8","type":"journal-article","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:28:22Z","timestamp":1503059302000},"page":"667-683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A 2D non-overlapping code over a q-ary alphabet"],"prefix":"10.1007","volume":"10","author":[{"given":"Elena","family":"Barcucci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5363-7756","authenticated-orcid":false,"given":"Antonio","family":"Bernini","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Bilotta","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,18]]},"reference":[{"key":"251_CR1","unstructured":"Aigner, M.: Discrete Matemathics. American Mathematical Society (2007)"},{"key":"251_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-642-35843-2_13","volume":"7741","author":"M Anselmo","year":"2013","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Two-dimensional rational automata: A bridge unifying one- and two-dimensional language theory. Lect. Notes Comput. Sci. 7741, 133\u2013145 (2013)","journal-title":"Lect. Notes Comput. Sci."},{"key":"251_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-319-15579-1_24","volume":"8977","author":"M Anselmo","year":"2015","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Structure and measure of a decidable class of two-dimensional codes. Lect. Notes Comput. Sci. 8977, 315\u2013327 (2015)","journal-title":"Lect. Notes Comput. Sci."},{"key":"251_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-319-23021-4_5","volume":"9270","author":"M Anselmo","year":"2015","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Unbordered pictures: Properties and construction. Lect. Notes Comput. Sci. 9270, 45\u201357 (2015)","journal-title":"Lect. Notes Comput. Sci."},{"key":"251_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.disc.2013.12.011","volume":"321","author":"A Bacher","year":"2014","unstructured":"Bacher, A., Bernini, A., Ferrari, L., Gunby, B., Pinzani, R., West, J.: The Dyck pattern poset. Discrete Math. 321, 12\u201323 (2014)","journal-title":"Discrete Math."},{"key":"251_CR6","doi-asserted-by":"publisher","unstructured":"Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: Cross-bifix-free sets in two dimensions. Theoret. Comput Sci. (2015). doi: 10.1016\/j.tcs.2015.08.032","DOI":"10.1016\/j.tcs.2015.08.032"},{"key":"251_CR7","doi-asserted-by":"publisher","unstructured":"Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: Non-overlapping matrices. Theoret. Comput Sci. (2016). doi: 10.1016\/j.tcs.2016.05.009","DOI":"10.1016\/j.tcs.2016.05.009"},{"key":"251_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1051\/ita\/2016008","volume":"50","author":"E Barcucci","year":"2016","unstructured":"Barcucci, E., Bilotta, S., Pergola, E., Pinzani, R., Succi, J.: Cross-bifix-free generation via Motzkin paths . RAIRO Theor. Inform. Appl. 50, 81\u201391 (2016)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"251_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s12095-013-0088-8","volume":"6","author":"D Bajic","year":"2014","unstructured":"Bajic, D., Loncar-Turukalo, T.: A simple suboptimal construction of cross-bifix-free codes. Cryptogr. Commun. 6, 27\u201337 (2014)","journal-title":"Cryptogr. Commun."},{"key":"251_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s12095-014-0105-6","volume":"6","author":"A Bernini","year":"2014","unstructured":"Bernini, A., Bilotta, S., Pinzani, R., Sabri, A., Vajnovszki, V.: Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6, 359\u2013369 (2014)","journal-title":"Cryptogr. Commun."},{"key":"251_CR11","first-page":"683","volume":"2013","author":"A Bernini","year":"2013","unstructured":"Bernini, A., Ferrari, L., Pinzani, R., West, J.: Pattern-avoiding Dyck paths. Discrete Math. Theoret. Comput. Sci. FPSAC 2013, 683\u2013694 (2013)","journal-title":"Discrete Math. Theoret. Comput. Sci. FPSAC"},{"key":"251_CR12","doi-asserted-by":"crossref","first-page":"P146","DOI":"10.37236\/633","volume":"18","author":"A Bernini","year":"2011","unstructured":"Bernini, A., Ferrari, L., Steingr\u00edmsson, E.: The M\u00f6bius function of the consecutive pattern poset. Electron. J. Combin. 18, P146 (2011)","journal-title":"Electron. J. Combin."},{"key":"251_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00236-013-0176-4","volume":"50","author":"S Bilotta","year":"2013","unstructured":"Bilotta, S., Grazzini, E., Pergola, E., Pinzani, R.: Avoiding cross-bifix-free binary words. Acta Inform. 50, 157\u2013173 (2013)","journal-title":"Acta Inform."},{"key":"251_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/FI-2012-687","volume":"117","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Merlini, D., Pergola, E., Pinzani, R.: Pattern 1 j+10 j avoiding binary words. Fund. Inform. 117, 35\u201355 (2012)","journal-title":"Fund. Inform."},{"key":"251_CR15","doi-asserted-by":"crossref","first-page":"4058","DOI":"10.1109\/TIT.2012.2189479","volume":"58","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Trans. Inform. Theory 58, 4058\u20134063 (2012)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"251_CR16","volume-title":"The M\u00f6bius Function of Subword Order. Invariant Theory and Tableaux (Minneapolis, MN, 1988), 118124, IMA Vol. Math Appl., vol. 19","author":"A Bj\u00f6rner","year":"1990","unstructured":"Bj\u00f6rner, A.: The M\u00f6bius Function of Subword Order. Invariant Theory and Tableaux (Minneapolis, MN, 1988), 118124, IMA Vol. Math Appl., vol. 19. Springer, New York (1990)"},{"key":"251_CR17","doi-asserted-by":"crossref","first-page":"4890","DOI":"10.1109\/TIT.2015.2456634","volume":"61","author":"S Blackburn","year":"2015","unstructured":"Blackburn, S.: Non-overlapping codes. IEEE Trans. Inform. Theory 61, 4890\u20134894 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"251_CR18","unstructured":"Burstein, A.: Enumeration of Words with Forbidden Patterns. PhD thesis, University of Pennsylvania (1998)"},{"key":"251_CR19","doi-asserted-by":"crossref","first-page":"4668","DOI":"10.1109\/TIT.2013.2252952","volume":"59","author":"YM Chee","year":"2013","unstructured":"Chee, Y.M., Kiah, H.M., Purkayastha, P., Wang, C.: Cross-bifix-free codes within a constant factor of optimality. IEEE Trans. Inform. Theory 59, 4668\u20134674 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"251_CR20","first-page":"739","volume":"33","author":"MC Er","year":"1984","unstructured":"Er, M.C.: On generating the N-ary reflected Gray code. IEEE Trans. Comput. 33, 739\u2013741 (1984)","journal-title":"IEEE Trans. Comput."},{"key":"251_CR21","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinaotrics. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511801655"},{"issue":"632","key":"251_CR22","first-page":"058","volume":"2","author":"F Gray","year":"1953","unstructured":"Gray, F.: Pulse code communication. U.S. Patent 2(632), 058 (1953)","journal-title":"U.S. Patent"},{"key":"251_CR23","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A. M.: String overlaps, pattern matching and nontransitive games. J. Combin. Theory Ser. A 30, 183\u2013208 (1981)","journal-title":"J. Combin. Theory Ser. A"},{"key":"251_CR24","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/eujc.1996.0005","volume":"17","author":"M Klazar","year":"1996","unstructured":"Klazar, M.: On abab-free and abba-free sets partitions. European J. Combin. 17, 53\u201368 (1996)","journal-title":"European J. Combin."},{"key":"251_CR25","volume-title":"The Art of Computer Programming, vol. 1","author":"D Knuth","year":"1968","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 1. Addison Wesley, Boston (1968)"},{"key":"251_CR26","doi-asserted-by":"crossref","unstructured":"Lando, S.K.: Lecture on Generating Functions. American Mathematical Society (2003)","DOI":"10.1090\/stml\/023"},{"key":"251_CR27","first-page":"355","volume":"6","author":"VI Levenshtein","year":"1970","unstructured":"Levenshtein, V.I.: Maximum number of words in codes without overlaps. Prob. Inform. Transmission 6, 355\u2013357 (1970)","journal-title":"Prob. Inform. Transmission"},{"key":"251_CR28","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/978-3-319-04921-2_44","volume":"8370","author":"F Otto","year":"2014","unstructured":"Otto, F., Mr\u00e1z, F.: Extended two-way ordered restarting automata for picture languages. Lecture Notes Comput. Sci. 8370, 541\u2013552 (2014)","journal-title":"Lecture Notes Comput. Sci."},{"key":"251_CR29","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1016\/j.ic.2011.07.001","volume":"209","author":"M Pradella","year":"2011","unstructured":"Pradella, M., Cherubini, A., Crespi-Reghizzi, S.: A unifying approach to picture grammars. Inform. Comput. 209, 1246\u20131267 (2011)","journal-title":"Inform. Comput."},{"key":"251_CR30","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.jcta.2010.03.004","volume":"117","author":"E Rowland","year":"2010","unstructured":"Rowland, E.: Pattern avoidance in binary trees. J. Combin. Theory Ser. A 117, 741\u2013758 (2010)","journal-title":"J. Combin. Theory Ser. A"},{"key":"251_CR31","first-page":"79","volume":"117","author":"BE Sagan","year":"2010","unstructured":"Sagan, B.E.: Pattern avoidance in set partitions. Ars Combin. 117, 79\u201396 (2010)","journal-title":"Ars Combin."},{"key":"251_CR32","volume-title":"Complex Variables","author":"MR Spiegel","year":"1964","unstructured":"Spiegel, M.R.: Complex Variables. McGraw-Hill, New York (1964)"},{"key":"251_CR33","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/00150517.1998.12428948","volume":"36","author":"DA Wolfram","year":"1998","unstructured":"Wolfram, D.A.: Solving generalized Fibonacci recurrences. Fibonacci Quart. 36, 129\u2013145 (1998)","journal-title":"Fibonacci Quart."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0251-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0251-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0251-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T23:26:25Z","timestamp":1750807585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0251-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,18]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["251"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0251-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,18]]}}}