{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T18:41:18Z","timestamp":1777315278876,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T00:00:00Z","timestamp":1665187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T00:00:00Z","timestamp":1665187200000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s12095-022-00611-5","type":"journal-article","created":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T13:02:41Z","timestamp":1665234161000},"page":"443-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new binary (17,4,5) constant weight code"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0466-1282","authenticated-orcid":false,"given":"Moshe","family":"Milshtein","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,8]]},"reference":[{"key":"611_CR1","unstructured":"Brouwer, A.E.: Bounds for binary constant weight codes. website at https:\/\/www.win.tue.nl\/~aeb\/codes\/Andw.html. Accessed 24 Nov 2020"},{"issue":"1","key":"611_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/18.651061","volume":"44","author":"VD Tonchev","year":"1998","unstructured":"Tonchev, V.D.: Maximum disjoint bases and constant-weight codes. IEEE Trans. Inf. Theory 44(1), 333\u2013334 (1998). https:\/\/doi.org\/10.1109\/18.651061","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"611_CR3","doi-asserted-by":"publisher","first-page":"3779","DOI":"10.1109\/TIT.2010.2050922","volume":"56","author":"PRJ Ostergard","year":"2010","unstructured":"Ostergard, P.R.J.: Classification of binary constant weight codes. IEEE Trans. Inf. Theory 56(8), 3779\u20133785 (2010). https:\/\/doi.org\/10.1109\/TIT.2010.2050922","journal-title":"IEEE Trans. Inf. Theory"},{"key":"611_CR4","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, New York (2004)"},{"key":"611_CR5","doi-asserted-by":"crossref","unstructured":"Verel, S., Collard, P., Clergue, M.: Scuba search: when selection meets innovation. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), vol.\u00a01. pp. 924\u2013931 (2004)","DOI":"10.1109\/CEC.2004.1330960"},{"key":"611_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-20364-0_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"ME Marmion","year":"2011","unstructured":"Marmion, M.E., Dhaenens, C., Jourdan, L., Liefooghe, A., Verel, S.: NILS: A neutrality-based iterated local search and its application to flowshop scheduling. In: Merz, P., Hao, J.K. (eds.) Evolutionary Computation in Combinatorial Optimization, pp. 191\u2013202. Springer, Berlin (2011)"},{"key":"611_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-44973-4_14","volume-title":"Learning and Intelligent Optimization","author":"ME Marmion","year":"2013","unstructured":"Marmion, M.E., Blot, A., Jourdan, L., Dhaenens, C.: Neutrality in the graph coloring problem. In: Nicosia, G., Pardalos, P. (eds.) Learning and Intelligent Optimization, pp. 125\u2013130. Springer, Berlin (2013)"},{"key":"611_CR8","doi-asserted-by":"crossref","unstructured":"Barnett, L.: Netcrawling-optimal evolutionary search with neutral networks. In: Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546). vol.\u00a01, pp. 30\u201337. (2001)","DOI":"10.1109\/CEC.2001.934367"},{"key":"611_CR9","doi-asserted-by":"publisher","unstructured":"Marmion, M.E., Dhaenens, C., Jourdan, L., Liefooghe, A., Verel, S.: The Road to VEGAS: Guiding the search over neutral networks. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation. GECCO \u201911. New York, NY, USA: Association for Computing Machinery, pp. 1979\u20131986. Available from: https:\/\/doi.org\/10.1145\/2001576.2001842 (2011)","DOI":"10.1145\/2001576.2001842"},{"issue":"3","key":"611_CR10","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.09.064","journal-title":"Eur. J. Oper. Res."},{"key":"611_CR11","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Reducibility among Combinatorial Problems. Boston, MA: Springer US. pp. 85\u2013103. Available from: https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"611_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C Friden","year":"1989","unstructured":"Friden, C., Hertz, A., de Werra, D.: Stabulus: a technique for finding stable sets in large graphs with tabu search. Computing 42(1), 35\u201344 (1989)","journal-title":"Computing"},{"issue":"1","key":"611_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985). https:\/\/doi.org\/10.1145\/3147.3165","journal-title":"ACM Trans. Math. Softw."}],"updated-by":[{"DOI":"10.1007\/s12095-023-00638-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000}}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00611-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00611-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00611-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T11:39:27Z","timestamp":1728128367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00611-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,8]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["611"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00611-5","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s12095-023-00638-2","asserted-by":"object"}]},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,8]]},"assertion":[{"value":"19 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s12095-023-00638-2","URL":"https:\/\/doi.org\/10.1007\/s12095-023-00638-2","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}