{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:04:46Z","timestamp":1750277086697},"reference-count":28,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T00:00:00Z","timestamp":1431302400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p>A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed in Chee<jats:italic>et al.<\/jats:italic>(2013) within a constant factor of optimality. We propose a Gray code for these cross-bifix-free sets and a CAT algorithm generating it. Our Gray code list is trace partitioned, that is, words with zero in the same positions are consecutive in the list.<\/jats:p>","DOI":"10.1017\/s0960129515000067","type":"journal-article","created":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T07:41:30Z","timestamp":1431330090000},"page":"184-196","source":"Crossref","is-referenced-by-count":12,"title":["A Gray code for cross-bifix-free sets"],"prefix":"10.1017","volume":"27","author":[{"given":"ANTONIO","family":"BERNINI","sequence":"first","affiliation":[]},{"given":"STEFANO","family":"BILOTTA","sequence":"additional","affiliation":[]},{"given":"RENZO","family":"PINZANI","sequence":"additional","affiliation":[]},{"given":"VINCENT","family":"VAJNOVSZKI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,5,11]]},"reference":[{"key":"S0960129515000067_ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"S0960129515000067_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_5"},{"key":"S0960129515000067_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90029-3"},{"key":"S0960129515000067_ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.891223"},{"key":"S0960129515000067_ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189479"},{"key":"S0960129515000067_ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.5009360"},{"key":"S0960129515000067_ref18","first-page":"312","article-title":"A Gray code based ordering for documents on shelves","volume":"43","author":"Losee","year":"1992","journal-title":"Journal of the Association for Information Science"},{"key":"S0960129515000067_ref17","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1109\/TCOM.1981.1094886","article-title":"Gray codes generation for MPSK signals","volume":"29","author":"Kobayashi","year":"1981","journal-title":"IEEE Transactions on Communications"},{"key":"S0960129515000067_ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252952"},{"key":"S0960129515000067_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-014-0105-6"},{"key":"S0960129515000067_ref23","unstructured":"Tsuiki H. (1998). Gray code representation of exact real numbers. In: Proceedings of the 3rd Workshop on Computability and Complexity in Analysis."},{"key":"S0960129515000067_ref1","volume-title":"2nd MCM COST 2100, TD(07)237","author":"Bajic","year":"2007"},{"key":"S0960129515000067_ref28","volume-title":"Combinatorics for Computer Science","author":"Williamson","year":"1985"},{"key":"S0960129515000067_ref7","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/35.3.299"},{"key":"S0960129515000067_ref14","unstructured":"Gray F. (1953). Pulse Code Communication. U.S. Patent 2 632 058."},{"key":"S0960129515000067_ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1963-0159764-2"},{"key":"S0960129515000067_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.06.002"},{"key":"S0960129515000067_ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0209014"},{"key":"S0960129515000067_ref21","unstructured":"Ruskey F. Combinatorial generation, Book in preparation."},{"key":"S0960129515000067_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195768"},{"key":"S0960129515000067_ref13","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0872-106"},{"key":"S0960129515000067_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853"},{"key":"S0960129515000067_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57568-5_250"},{"key":"S0960129515000067_ref22","first-page":"79","article-title":"Pattern avoidance in set partitions","volume":"94","author":"Sagan","year":"2010","journal-title":"Ars Combinatoria"},{"key":"S0960129515000067_ref26","first-page":"95","article-title":"Gray codes for involutions","volume":"36","author":"Walsh","year":"2001","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"S0960129515000067_ref24","doi-asserted-by":"crossref","unstructured":"Vajnovszki V. (2001a). A loopless generation of bitstrings without p consecutive ones. Discrete Mathematics and Theoretical Computer Science-Springer, 227\u2013240.","DOI":"10.1007\/978-1-4471-0717-0_19"},{"key":"S0960129515000067_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-002-0097-0"},{"key":"S0960129515000067_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/360336.360343"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129515000067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T22:11:01Z","timestamp":1566684661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129515000067\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,11]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["S0960129515000067"],"URL":"https:\/\/doi.org\/10.1017\/s0960129515000067","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,11]]}}}