{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:52Z","timestamp":1767229732372,"version":"3.48.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_12","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"137-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gray Cycles of\u00a0Maximum Length Related to\u00a0k-Character Substitutions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9630-461X","authenticated-orcid":false,"given":"Jean","family":"N\u00e9raud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1080\/10236199908808200","volume":"5","author":"E Bartucci","year":"2009","unstructured":"Bartucci, E., Lungo, A.D., Pergola, E., Pinzani, R.: ECO: a methodology for the enumeration of combinatorial objects. J. Differ. Equ. Appl. 5, 435\u2013490 (2009). https:\/\/doi.org\/10.1080\/10236199908808200","journal-title":"J. Differ. Equ. Appl."},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","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(4), 359\u2013369 (2014). https:\/\/doi.org\/10.1007\/s12095-014-0105-6","journal-title":"Cryptogr. Commun."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F Chung","year":"1992","unstructured":"Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Math. 110, 43\u201359 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90699-G","journal-title":"Discrete Math."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/S0019-9958(63)90119-0","volume":"6","author":"M Cohn","year":"1963","unstructured":"Cohn, M.: Affine m-ary gray codes. Inf. Control 6(1), 70\u201378 (1963). https:\/\/doi.org\/10.1016\/S0019-9958(63)90119-0","journal-title":"Inf. Control"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Cohn, P.: Universal Algebra (Mathematics and Its Applications), vol. 6. Springer, Dordrecht (1981). https:\/\/doi.org\/10.1007\/978-94-009-8399-1","DOI":"10.1007\/978-94-009-8399-1"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P Eades","year":"1984","unstructured":"Eades, P., McKay, B.: An algorithm for generating subsets of fixed size with a strong minimal change property. Inf. Proc. Lett. 19, 131\u2013133 (1984). https:\/\/doi.org\/10.1016\/0020-0190(84)90091-7","journal-title":"Inf. Proc. Lett."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. ACM 20, 500\u2013513 (1973). https:\/\/doi.org\/10.1145\/321765.321781","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Er, M.C.: On generating the N-ary reflected gray codes. IEEE Trans. Comput. C-33(8), 739\u2013741 (1984). https:\/\/doi.org\/10.1109\/TC.1984.5009360","DOI":"10.1109\/TC.1984.5009360"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math. 23(3), 207\u2013210 (1978). https:\/\/doi.org\/10.1016\/0012-365X(78)90002-X","journal-title":"Discrete Math."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1002\/j.1538-7305.1958.tb03887.x","volume":"37","author":"E Gilbert","year":"1958","unstructured":"Gilbert, E.: Gray codes and paths on the N-cube. The Bell Syst. Tech. J. 37, 815\u2013826 (1958). https:\/\/doi.org\/10.1002\/j.1538-7305.1958.tb03887.x","journal-title":"The Bell Syst. Tech. J."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1137\/0209013","volume":"9","author":"JT Joichi","year":"1980","unstructured":"Joichi, J.T., White, D.E., Williamson, S.G.: Combinatorial Gray codes. SIAM J. Comput. 9, 130\u2013141 (1980). https:\/\/doi.org\/10.1137\/0209013","journal-title":"SIAM J. Comput."},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Handbook of Formal Languages, vol. 1, chap. 8, pp. 511\u2013607. Springer Verlag, Berlin (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_8","DOI":"10.1007\/978-3-642-59136-5_8"},{"issue":"6","key":"12_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(76)90014-4","volume":"5","author":"R Kaye","year":"1976","unstructured":"Kaye, R.: A gray code for set partitions. Inform. Process. Lett. 5(6), 171\u2013173 (1976). https:\/\/doi.org\/10.1016\/0020-0190(76)90014-4","journal-title":"Inform. Process. Lett."},{"key":"12_CR14","unstructured":"Knuth, D.: The Art of Computer programming. In: Fascicle 2: Generating All Tuples and Permutations, vol. 4. Addison Wesley, Boston (2005). ISBN-10: 0-201-85393-0, ISBN 13: 978-0-201-85393-3"},{"key":"12_CR15","unstructured":"Lehmer, D.H.: The machine tools of combinatorics. In: Beckenbach, E. (ed.) Applied Combinatorial Mathematics. pp. 5\u201331. John Wiley and Sons, New York (1964). ISBN 10: 0-471-06125-5, ISBN 13: 978-0-471-06125-0"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Ludman, J.: Gray code generation for MPSK signals. IEEE Trans. Commun. COM-29, 1519\u20131522 (1981). https:\/\/doi.org\/10.1109\/TCOM.1981.1094886","DOI":"10.1109\/TCOM.1981.1094886"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"N\u00e9raud, J.: Variable-length codes independent or closed with respect to edit relations. Inf. Comput. arXiv:2104.14185 (2021, to appear). https:\/\/doi.org\/10.1016\/j.ic.2021.104747","DOI":"10.1016\/j.ic.2021.104747"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(86)90029-3","volume":"22","author":"D Richard","year":"1986","unstructured":"Richard, D.: Data compression and gray-code sorting. Inform. Process. Lett. 22, 201\u2013205 (1986). https:\/\/doi.org\/10.1016\/0020-0190(86)90029-3","journal-title":"Inform. Process. Lett."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.M.Y.: Generating necklaces. J. Algorithms 13, 414\u2013430 (1992). https:\/\/doi.org\/10.1016\/0196-6774(92)90047-G","journal-title":"J. Algorithms"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 39, 605\u2013629 (1997). https:\/\/doi.org\/10.1137\/S0036144595295272","journal-title":"SIAM Rev."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:04:17Z","timestamp":1767229457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}