{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:18Z","timestamp":1740122598734,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T00:00:00Z","timestamp":1642291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T00:00:00Z","timestamp":1642291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10623-021-01005-z","type":"journal-article","created":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T16:02:42Z","timestamp":1642348962000},"page":"835-850","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Isomorphism of maximum length circuit codes"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5079-2817","authenticated-orcid":false,"given":"Kevin M.","family":"Byrnes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,16]]},"reference":[{"key":"1005_CR1","first-page":"97","volume":"40","author":"HL Abbot","year":"1991","unstructured":"Abbot H.L., Katchalski M.: On the construction of snake in the box codes. Utilit. Math. 40, 97\u2013116 (1991).","journal-title":"Utilit. Math."},{"key":"1005_CR2","unstructured":"Allison D., Paulusma D.: New bounds for the snake-in-the-box problem. arXiv:1603.05119 (2016)."},{"key":"1005_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.dam.2015.01.026","volume":"186","author":"KM Byrnes","year":"2015","unstructured":"Byrnes K.M.: A tight analysis of the submodular-supermodular procedure. Discret. Appl. Math. 186, 275\u2013282 (2015).","journal-title":"Discret. Appl. Math."},{"key":"1005_CR4","first-page":"40","volume":"80","author":"KM Byrnes","year":"2017","unstructured":"Byrnes K.M.: A new method for constructing circuit codes. Bull. ICA 80, 40\u201360 (2017).","journal-title":"Bull. ICA"},{"issue":"11","key":"1005_CR5","doi-asserted-by":"publisher","first-page":"2671","DOI":"10.1007\/s10623-019-00646-5","volume":"87","author":"KM Byrnes","year":"2019","unstructured":"Byrnes K.M.: The maximum length of circuit codes with long bit runs and a new characterization theorem. Des. Codes Cryptogr. 87(11), 2671\u20132681 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1005_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2021.05.003","volume":"301","author":"KM Byrnes","year":"2021","unstructured":"Byrnes K.M., Spinu F.: On the asymptotic order of circuit codes. Discret. Appl. Math. 301, 69\u201373 (2021).","journal-title":"Discret. Appl. Math."},{"key":"1005_CR7","doi-asserted-by":"crossref","unstructured":"Chebiryak Y., Kroening D.: An efficient SAT encoding of circuit codes. In: International Symposium on Information Theory and Its Applications (2008).","DOI":"10.1109\/ISITA.2008.4895595"},{"key":"1005_CR8","unstructured":"Chien R., Freiman C.V., Tang D.T.: Error correction and circuits on the $$n$$-cube. In: Proceedings of the Second Annual Allerton Conference on Circuit and System Theory, pp. 899\u2013912 (1964)."},{"issue":"3","key":"1005_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/S0021-9800(67)80026-7","volume":"2","author":"L Danzer","year":"1967","unstructured":"Danzer L., Klee V.: Lengths of snakes in boxes. J. Comb. Theory 2(3), 258\u2013265 (1967).","journal-title":"J. Comb. Theory"},{"issue":"4","key":"1005_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0021-9800(69)80029-3","volume":"6","author":"RJ Douglas","year":"1969","unstructured":"Douglas R.J.: Some results on the maximum length of circuits of spread k in the d-cube. J. Comb. Theory 6(4), 323\u2013339 (1969).","journal-title":"J. Comb. Theory"},{"key":"1005_CR11","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/S0021-9800(69)80013-X","volume":"7","author":"RJ Douglas","year":"1969","unstructured":"Douglas R.J.: Upper bounds on the length of circuits of even spread in the d-cube. J. Comb. Theory 7, 206\u2013214 (1969).","journal-title":"J. Comb. Theory"},{"key":"1005_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0012-365X(99)00335-0","volume":"218","author":"P Emelyanov","year":"2000","unstructured":"Emelyanov P., Lukito A.: On the maximal length of a snake in hypercubes of small dimension. Discret. Math. 218, 51\u201359 (2000).","journal-title":"Discret. Math."},{"key":"1005_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum B., Shephard G., Klee V.: Convex Polytopes. Springer-Verlag, New York (2003)."},{"issue":"6","key":"1005_CR14","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/18.945274","volume":"47","author":"AP Hiltgen","year":"2001","unstructured":"Hiltgen A.P., Paterson K.G.: Single-track circuit codes. IEEE Trans. Inf. Theory 47(6), 2587\u20132595 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1005_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1109\/TIT.2016.2620160","volume":"63","author":"AE Holroyd","year":"2017","unstructured":"Holroyd A.E.: Perfect snake-in-the-box codes for rank modulation. IEEE Trans. Inf. Theory 63(1), 104\u2013110 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1005_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s10878-013-9630-z","volume":"30","author":"S Hood","year":"2013","unstructured":"Hood S., Recoskie D., Sawada J., Wong D.: Snakes, coils, and single-track circuit codes with spread k. J. Comb. Optim. 30(1), 42\u201362 (2013).","journal-title":"J. Comb. Optim."},{"key":"1005_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","volume":"7","author":"WH Kautz","year":"1958","unstructured":"Kautz W.H.: Unit-distance error-checking codes. IRE Trans. Electron. Comput. 7, 179\u2013180 (1958).","journal-title":"IRE Trans. Electron. Comput."},{"issue":"3","key":"1005_CR18","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/321406.321414","volume":"14","author":"V Klee","year":"1967","unstructured":"Klee V.: A method for constructing circuit codes. J. ACM 14(3), 520\u2013528 (1967).","journal-title":"J. ACM"},{"key":"1005_CR19","first-page":"175","volume":"20","author":"KJ Kochut","year":"1996","unstructured":"Kochut K.J.: Snake-in-the-box-code for dimension 7. J. Comb. Math. Comb. Comput. 20, 175\u2013185 (1996).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1005_CR20","first-page":"147","volume":"39","author":"A Lukito","year":"2001","unstructured":"Lukito A., van Zanten A.J.: A new non-asymptotic upper bound for snake-in-the-box codes. J. Comb. Math. Comb. Comput. 39, 147\u2013156 (2001).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1005_CR21","doi-asserted-by":"crossref","unstructured":"Meyerson S.J., Whiteside W.E., Drapela T.E., Potter W.D.: Finding longest paths in hypercubes, snakes and coils. In: 2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES), pp. 103\u2013109 (2014).","DOI":"10.1109\/CIES.2014.7011838"},{"key":"1005_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.dam.2014.07.010","volume":"179","author":"P \u00d6sterg\u00e5rd","year":"2014","unstructured":"\u00d6sterg\u00e5rd P., Pettersson V.: On the maximum length of coil-in-the-box codes in dimension 8. Discret. Appl. Math. 179, 193\u2013200 (2014).","journal-title":"Discret. Appl. Math."},{"key":"1005_CR23","doi-asserted-by":"crossref","unstructured":"Palombo A., Stern R., Puzis R., Felner A., Kiesel S., Ruml W.: Solving the snake in the box problem with heuristic search: first results. In: Symposium on Combinatorial Search (SOCS), pp. 96\u2013104 (2015).","DOI":"10.1609\/socs.v6i1.18357"},{"issue":"3","key":"1005_CR24","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/18.669420","volume":"44","author":"K Paterson","year":"1998","unstructured":"Paterson K., Tuliani J.: Some new circuit codes. IEEE Trans. Inf. Theory 44(3), 1305\u20131309 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1005_CR25","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TIT.1974.1055267","volume":"20","author":"FP Preparata","year":"1974","unstructured":"Preparata F.P., Nievergelt J.: Difference-preserving codes. IEEE Trans. Inf. Theory 20(5), 643\u2013649 (1974).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1005_CR26","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1109\/PGEC.1966.264382","volume":"15","author":"RC Singleton","year":"1966","unstructured":"Singleton R.C.: Generalized snake-in-the-box codes. IEEE Trans. Electron. Comput. 15, 596\u2013602 (1966).","journal-title":"IEEE Trans. Electron. Comput."},{"key":"1005_CR27","unstructured":"Sloane N.J.A.: The on-line encyclopedia of integer sequences. http:\/\/oeis.org. Sequences A000937, A289424, A289425, A289426."},{"key":"1005_CR28","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0012-365X(94)90039-6","volume":"133","author":"H Snevily","year":"1994","unstructured":"Snevily H.: The snake-in-the-box problem: a new upper bound. Discret. Math. 133, 307\u2013314 (1994).","journal-title":"Discret. Math."},{"key":"1005_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10623-016-0239-y","volume":"83","author":"X Wang","year":"2017","unstructured":"Wang X., Fu F.W.: On the snake-in-the-box codes for rank modulation under Kendall\u2019s $$\\tau $$-metric. Des. Codes Cryptogr. 83, 455\u2013465 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"1005_CR30","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10623-019-00693-y","volume":"88","author":"X Wang","year":"2020","unstructured":"Wang X., Fu F.W.: Snake-in-the-Box codes under the $$\\ell _{\\infty }$$-metric for rank modulation. Des. Codes Cryptogr. 88, 487\u2013503 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1005_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02122688","volume":"9","author":"J Wojciechowski","year":"1989","unstructured":"Wojciechowski J.: A new lower bound for snake-in-the-box codes. Combinatorica 9(1), 91\u201399 (1989).","journal-title":"Combinatorica"},{"issue":"8","key":"1005_CR32","doi-asserted-by":"publisher","first-page":"5471","DOI":"10.1109\/TIT.2012.2196755","volume":"58","author":"Y Yehezkeally","year":"2012","unstructured":"Yehezkeally Y., Schwartz M.: Snake-in-the-Box codes for rank modulation. IEEE Trans. Inf. Theory 58(8), 5471\u20135483 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1005_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF01200911","volume":"17","author":"G Zemor","year":"1997","unstructured":"Zemor G.: An upper bound on the size of the snake-in-the-box. Combinatorica 17, 287\u2013298 (1997).","journal-title":"Combinatorica"},{"issue":"2","key":"1005_CR34","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TIT.2009.2037078","volume":"56","author":"I Zinovik","year":"2010","unstructured":"Zinovik I., Chebiryak Y., Kroening D.: Periodic orbits and equilibria in Glass models for gene regulatory networks. IEEE Trans. Inf. Theory 56(2), 805\u2013820 (2010).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01005-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-01005-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01005-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T03:53:24Z","timestamp":1674446004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-01005-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,16]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1005"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-01005-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,1,16]]},"assertion":[{"value":"25 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}