{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:12Z","timestamp":1760597892742,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10623-019-00646-5","type":"journal-article","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T12:03:03Z","timestamp":1558699383000},"page":"2671-2681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The maximum length of circuit codes with long bit runs and a new characterization theorem"],"prefix":"10.1007","volume":"87","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":[[2019,5,24]]},"reference":[{"key":"646_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. Util. Math. 40, 97\u2013116 (1991).","journal-title":"Util. Math."},{"key":"646_CR2","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"},{"key":"646_CR3","unstructured":"Casella D.A., Potter W.D.: New lower bounds for the snake-in-the-box problem: Using evolutionary techniques to hunt for snakes. In: Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, pp. 264\u2013269 (2005)."},{"key":"646_CR4","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":"646_CR5","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/TIT.1984.1056958","volume":"30","author":"K Deimer","year":"1984","unstructured":"Deimer K.: Some new bounds on the maximum length of circuit codes. IEEE Trans. Inf. Theory 30, 754\u2013756 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"646_CR6","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":"646_CR7","doi-asserted-by":"crossref","first-page":"R27","DOI":"10.37236\/1720","volume":"10","author":"L Goddyn","year":"2003","unstructured":"Goddyn L., Gvozdjak P.: Binary Gray codes with long bit runs. Electron J. Comb. 10, R27 (2003).","journal-title":"Electron J. Comb."},{"key":"646_CR8","first-page":"179","volume":"34","author":"L Goddyn","year":"1988","unstructured":"Goddyn L., Lawrence G., Nemeth E.: Gray codes with optimized bit runs. Util. Math. 34, 179\u2013192 (1988).","journal-title":"Util. Math."},{"key":"646_CR9","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, New York (2003)."},{"issue":"4","key":"646_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","volume":"15","author":"F Harary","year":"1988","unstructured":"Harary F., Hayes J.P., Wu H.: A survey of the theory of hypercube graphs. Comput. Math. Appl. 15(4), 277\u2013289 (1988).","journal-title":"Comput. Math. Appl."},{"issue":"6","key":"646_CR11","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":"646_CR12","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":"646_CR13","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":"646_CR14","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":"646_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/00029890.1970.11992422","volume":"77","author":"V Klee","year":"1970","unstructured":"Klee V.: What is the maximum length of a $$d$$-dimensional snake? Am. Math. Mon. 77, 63\u201365 (1970).","journal-title":"Am. Math. Mon."},{"key":"646_CR16","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."},{"issue":"3","key":"646_CR17","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":"646_CR18","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":"646_CR19","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":"646_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1023\/A:1008393130864","volume":"16","author":"AJ van Zanten","year":"1999","unstructured":"van Zanten A.J., Lukito A.: Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics. Des. Codes Cryptogr. 16, 605\u2013629 (1999).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"646_CR21","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1109\/TIT.2008.917695","volume":"54","author":"I Zinovik","year":"2008","unstructured":"Zinovik I., Kroening D., Chebiryak Y.: Computing binary combinatorial Gray codes via exhaustive search with SAT solvers. IEEE Trans. Inf. Theory 54(4), 1819\u20131823 (2008).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00646-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00646-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00646-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T23:07:22Z","timestamp":1590188842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00646-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,24]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["646"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00646-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,5,24]]},"assertion":[{"value":"7 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}