{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:16Z","timestamp":1754161576200,"version":"3.41.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1008393130864","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"185-199","source":"Crossref","is-referenced-by-count":4,"title":["Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics"],"prefix":"10.1007","volume":"16","author":[{"given":"A. J. van","family":"Zanten","sequence":"first","affiliation":[]},{"given":"Agung","family":"Lukito","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"195209_CR1","first-page":"97","volume":"40","author":"H. L. Abott","year":"1991","unstructured":"H. L. Abott and M. Katchalski, On the construction of snake-in-the-box codes, Utilitas Math., Vol. 40 (1991) pp. 97-116.","journal-title":"Utilitas Math."},{"key":"195209_CR2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0021-9800(69)80029-3","volume":"6","author":"R. J. Douglas","year":"1969","unstructured":"R. J. Douglas, Some results on the maximum length of circuits of spread k in the d-cube, J. Comb. Theory, Vol. 6 (1969) pp. 323-339.","journal-title":"J. Comb. Theory"},{"key":"195209_CR3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/S0021-9800(69)80013-X","volume":"7","author":"R. J. Douglas","year":"1969","unstructured":"R. J. Douglas, Upper bounds on the length of circuits of even spread in the d-cube, J. Comb. Theory, Vol. 7 (1969) pp. 206-214.","journal-title":"J. Comb. Theory"},{"key":"195209_CR4","volume-title":"Discrete Analysis and Operations Research","author":"P. G. Emel'yanov","year":"1997","unstructured":"P. G. Emel'yanov, An upper bound for the length of a snake-in-the n-dimensional unit cube, in Discrete Analysis and Operations Research (A. D. Korshunov, ed.), Kluwer Academic Publishers, Dordrecht\/Boston\/London (1997). (Translation from Sib. Zh. Issled. Oper., Vol. 2 (1995) pp. 10\u201317)."},{"key":"195209_CR5","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1007\/BF01119684","volume":"6","author":"A. A. Evdokimov","year":"1969","unstructured":"A. A. Evdokimov, Maximal length of a circuit in a unitary n-dimensional cube, Math. Notes, Vol. 6 (1969) pp. 642-648.","journal-title":"Math. Notes"},{"key":"195209_CR6","first-page":"900","volume":"17","author":"A. A. Evdokimov","year":"1976","unstructured":"A. A. Evdokimov, Circuit codes with arbitrary distance, Soviet Math. Dokl., Vol. 17 (1976) pp. 900-904.","journal-title":"Soviet Math. Dokl."},{"key":"195209_CR7","volume-title":"Metody Diskretnogo Analiza v Reshenii Kombinatornykh Zadach","author":"A. A. Evdokimov","year":"1980","unstructured":"A. A. Evdokimov, O numeratsii podmnozhestv konechnogo mnozhestva (1980), in Metody Diskretnogo Analiza v Reshenii Kombinatornykh Zadach, Sbornik trudov Instituta Matematiki SO AN SSSR, Vypusk 34 (1980)."},{"key":"195209_CR8","volume-title":"Discrete Analysis and Operations Research","author":"A. A. Evdokimov","year":"1996","unstructured":"A. A. Evdokimov, Locally isometric embeddings of graphs and the metric prolongation property, in Discrete Analysis and Operations Research (A. D. Korshunov, ed.), Kluwer Academic Publishers, Dordrecht\/Boston\/London (1996)."},{"key":"195209_CR9","first-page":"175","volume":"20","author":"K. J. Kochut","year":"1996","unstructured":"K. J. Kochut, Snake-in-the-box codes for dimension 7, J. Combin. Math. and Combin. Comput., Vol. 20 (1996) pp. 175-185.","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"195209_CR10","first-page":"69","volume":"3","author":"A. L. Perezhogin","year":"1996","unstructured":"A. L. Perezhogin, On local isometric coding of natural numbers, Discrete Analysis and Operations Research, Vol. 3 (1996) pp. 69-76 (in Russian).","journal-title":"Discrete Analysis and Operations Research"},{"key":"195209_CR11","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TIT.1974.1055267","volume":"IT-20","author":"F. P. Preparata","year":"1974","unstructured":"F. P. Preparata and J. Nievergelt, Difference-preserving codes, IEEE Trans. Inform. Theory, Vol. IT-20 (1974) pp. 643-649.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"195209_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(94)90039-6","volume":"133","author":"H. S. Snevily","year":"1994","unstructured":"H. S. Snevily, The snake-in-the-box problem: A new upper bound, Discrete Math., Vol. 133 (1994) pp. 307-314.","journal-title":"Discrete Math."},{"key":"195209_CR13","doi-asserted-by":"crossref","first-page":"1988","DOI":"10.1109\/18.265509","volume":"IT-39","author":"A. J. van Zanten","year":"1993","unstructured":"A. J. van Zanten, Minimal-change order and separabiblity in linear codes, IEEE Trans. Inform. Theory, Vol. IT-39 (1993) pp. 1988-1989.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"195209_CR14","unstructured":"A. J. van Zanten, Difference-preserving codes, circuit codes and \u2329m, n\u232a-codes, Rept. 94\u201385, Faculty of Technical Mathematics and Informatics, Delft University of Technology (1994)."},{"key":"195209_CR15","volume-title":"Algebraic and Combinatorial Coding Theory, Proceedings of the Fifth International Workshop of the ACCT","author":"A. J. van Zanten","year":"1996","unstructured":"A. J. van Zanten, On the construction of distance-preserving codes, in Algebraic and Combinatorial Coding Theory, Proceedings of the Fifth International Workshop of the ACCT, Unicorn, Shumen (Bulg.) (1996)."},{"key":"195209_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200911","volume":"17","author":"G. Zemor","year":"1997","unstructured":"G. Zemor, An upper bound on the size of the snake-in-the-box, Combinatorica, Vol. 17 (1997) pp. 1-12.","journal-title":"Combinatorica"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008393130864.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008393130864\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008393130864.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:21:35Z","timestamp":1753759295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008393130864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["195209"],"URL":"https:\/\/doi.org\/10.1023\/a:1008393130864","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}