{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T21:36:57Z","timestamp":1648503417557},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10623-008-9202-x","type":"journal-article","created":{"date-parts":[[2008,4,15]],"date-time":"2008-04-15T20:23:04Z","timestamp":1208290984000},"page":"207-229","source":"Crossref","is-referenced-by-count":1,"title":["Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube"],"prefix":"10.1007","volume":"48","author":[{"given":"A. J.","family":"van Zanten","sequence":"first","affiliation":[]},{"given":"Loeky","family":"Haryanto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,16]]},"reference":[{"key":"9202_CR1","first-page":"97","volume":"40","author":"H.L. Abbott","year":"1991","unstructured":"Abbott H.L., Katchalski M. (1991) On the construction of snake-in-the-box codes. Utilitas Math. 40: 97\u2013116","journal-title":"Utilitas Math."},{"issue":"2","key":"9202_CR2","first-page":"261","volume":"66","author":"S.Y. Alsardary","year":"1997","unstructured":"Alsardary S.Y. (1997) Further results on vertex covering of powers of complete graphs. Acta Math. Univ. Comenianae 66(2): 261\u2013283","journal-title":"Acta Math. Univ. Comenianae"},{"key":"9202_CR3","unstructured":"Casella D.A.: New lower bounds for the snake-in-the-box and the coil-in-the-box problems: using evolutionary techniques to hunt for snakes and coils. MSAI thesis (2005)."},{"key":"9202_CR4","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 18th International Florida Artificial Intelligence Research Conference, pp. 264\u2013269 (2005)."},{"key":"9202_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0012-365X(99)00335-0","volume":"218","author":"P.G. Emelyanov","year":"2000","unstructured":"Emelyanov P.G., Lukito A. (2000) On the maximal length of a snake in a hypercube of small dimension. Discerete Math. 218: 51\u201359","journal-title":"Discerete Math."},{"key":"9202_CR6","unstructured":"Harary F.: Graph Theory, 3rd edn. Addison Wesley (1972)."},{"key":"9202_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","volume":"7","author":"W.H. Kautz","year":"1958","unstructured":"Kautz W.H. (1958) Unit distance error checking codes. IEEE Trans. Electron. Comput. 7: 179\u2013180","journal-title":"IEEE Trans. Electron. Comput."},{"key":"9202_CR8","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/321406.321414","volume":"14","author":"V. Klee","year":"1967","unstructured":"Klee V. (1967) A method for constructing circuit codes. J. Assoc. Comput. Mach. 14: 520\u2013528","journal-title":"J. Assoc. Comput. Mach."},{"key":"9202_CR9","unstructured":"Knuth D.E.: The art of computer programming, vol. 4 Fascicle 2. Generating all tuples and permutations. Addison Wesley (2005)."},{"key":"9202_CR10","first-page":"175","volume":"20","author":"K.J. Kochut","year":"1996","unstructured":"Kochut K.J. (1996) Snake-in-the-box codes for dimension 7. J. Combin. Math. Combin. Comput. 20: 175\u2013185","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"9202_CR11","unstructured":"Lukito A.: Bounds for the length of certain types of distance preserving codes. Ph.D. thesis, Delft University of Technology (2000)."},{"key":"9202_CR12","first-page":"147","volume":"39","author":"A. Lukito","year":"2001","unstructured":"Lukito A., van Zanten A.J. (2001) A new non-asymptotic upper bound for snake-in-the-box codes. J. Combin. Math. Combin. Comput. 39: 147\u2013156","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"9202_CR13","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North Holland Mathematical Library (1977)."},{"key":"9202_CR14","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/18.669420","volume":"44","author":"K.G. Paterson","year":"1998","unstructured":"Paterson K.G., Tuliani G. (1998) Some new circuit codes. IEEE Trans. Inform. Theory 44: 1305\u20131309","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9202_CR15","unstructured":"Potter W.D., et al.: Using the genetic algorithm to find snake-in-the-box codes. In: Proceedings of the 7th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. United States Austin, Texas, pp. 421\u2013426 (1994)."},{"key":"9202_CR16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(94)90039-6","volume":"133","author":"H.S. Snevily","year":"1994","unstructured":"Snevily H.S. (1994) The snake-in-the-box problem, a new upper bound. Discrete Math. 133: 307\u2013304","journal-title":"Discrete Math."},{"key":"9202_CR17","first-page":"71","volume":"45","author":"F.I. Solov\u2019jeva","year":"1987","unstructured":"Solov\u2019jeva F.I. (1987) An upper bound for the length of a cycle in an n-dimensional unit cube, Diskret. Analiz. 45: 71\u201376","journal-title":"Analiz."},{"key":"9202_CR18","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/BF01302970","volume":"14","author":"J. Wojciechowski","year":"1994","unstructured":"Wojciechowski J. (1994) Covering the hypercube with a bounded number of disjoint snakes. Combinatorica 14: 491\u2013496","journal-title":"Combinatorica"},{"key":"9202_CR19","doi-asserted-by":"crossref","first-page":"1988","DOI":"10.1109\/18.265509","volume":"39","author":"A.J. Zanten van","year":"1993","unstructured":"van Zanten A.J. (1993) Minimal-change order and separability in linear codes. IEEE Trans. Inform. Theory 39: 1988\u20131989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9202_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1008393130864","volume":"16","author":"A.J. Zanten van","year":"1999","unstructured":"van Zanten A.J., Lukito A. (1999) Construction of certain cyclic distance-preserving codes having linear-algebraic characteristic. Des. Codes Cryptogr. 16: 185\u2013199","journal-title":"Des. Codes Cryptogr."},{"key":"9202_CR21","unstructured":"van Zanten A.J., Haryanto L.: Covers and Near-Covers of the Hypercube Q 16 by Symmetric Snakes, Report CS 06-01. Department of Computer Science, Universiteit Maastricht (2006)."},{"key":"9202_CR22","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01200911","volume":"17","author":"G. Z\u00e9mor","year":"1997","unstructured":"Z\u00e9mor G. (1997) An upper bound of the size of snakes. Combinatorica 17: 287\u2013298","journal-title":"Combinatorica"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9202-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T13:05:38Z","timestamp":1549803938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9202-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,16]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9202"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9202-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,16]]}}}