{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:24:23Z","timestamp":1769916263066,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031300349","type":"print"},{"value":"9783031300356","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30035-6_8","type":"book-chapter","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T06:05:48Z","timestamp":1680156348000},"page":"114-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary Strategies for\u00a0the\u00a0Design of\u00a0Binary Linear Codes"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Manzoni","sequence":"additional","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"McEliece, R.J.: The Theory of Information and Coding. Number 86. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511819896"},{"key":"8_CR2","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W., eds.: Proceedings of a symposium on the Complexity of Computer Computations, held March 20\u201322, 1972, pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press, New York (1972)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Dontas, K., Jong, K.A.D.: Discovery of maximal distance codes using genetic algorithms. In: Proceedings of IEEE TAI 1990, pp. 805\u2013811. IEEE Computer Society (1990)","DOI":"10.1109\/TAI.1990.130442"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"McGuire, K.M., Sabin, R.E.: Using a genetic algorithm to find good linear error-correcting codes. In George, K.M., Lamont, G.B., eds. Proceedings of the 1998 ACM symposium on Applied Computing, SAC 1998, Atlanta, GA, USA, February 27 - March 1, 1998, pp. 332\u2013337. ACM (1998)","DOI":"10.1145\/330560.330834"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/71.663870","volume":"9","author":"H Chen","year":"1998","unstructured":"Chen, H., Flann, N.S., Watson, D.W.: Parallel genetic simulated annealing: a massively parallel SIMD algorithm. IEEE Trans. Parallel Distrib. Syst. 9(2), 126\u2013136 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"McCarney, D.E., Houghten, S.K., Ross, B.J.: Evolutionary approaches to the generation of optimal error correcting codes. In Soule, T., Moore, J.H., eds. Proceedings of GECCO 2012, pp. 1135\u20131142. ACM (2012)","DOI":"10.1145\/2330163.2330320"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1987.1057277","volume":"33","author":"AAE Gamal","year":"1987","unstructured":"Gamal, A.A.E., Hemachandra, L.A., Shperling, I., Wei, V.K.: Using simulated annealing to design good codes. IEEE Trans. Inf. Theory 33(1), 116\u2013123 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Alba, E., Chicano, J.F.: Solving the error correcting code problem with parallel hybrid heuristics. In: Haddad, H., Omicini, A., Wainwright, R.L., Liebrock, L.M., (eds.) Proceedings of SAC 2004), pp. 985\u2013989. ACM (2004)","DOI":"10.1145\/967900.968101"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-24652-7_6","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"C Cotta","year":"2004","unstructured":"Cotta, C.: Scatter search and memetic approaches to the error correcting code problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 51\u201361. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24652-7_6"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Blum, C., Blesa, M.J., Roli, A.: Combining ILS with an effective constructive heuristic for the application to error correcting code design. In: Metaheuristics International Conference (MIC-2005), Vienna, Austria, pp. 114\u2013119 (2005)","DOI":"10.1007\/11546245"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators. In: Advances in Mathematics of Communications (2022)","DOI":"10.3934\/amc.2022047"},{"key":"8_CR12","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes (2007). http:\/\/www.codetables.de. Accessed 13 Nov 2022"},{"key":"8_CR13","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-correcting Codes. Cambridge University Press (2010)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and coding theory (2021)","DOI":"10.1017\/9781108606806"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-99253-2_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary search of binary orthogonal arrays. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 121\u2013133. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_10"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-04070-3_12","volume-title":"Theory and Practice of Natural Computing","author":"K Knezevic","year":"2018","unstructured":"Knezevic, K., Picek, S., Mariot, L., Jakobovic, D., Leporati, A.: The design of (Almost) disjunct matrices by evolutionary algorithms. In: Fagan, D., Mart\u00edn-Vide, C., O\u2019Neill, M., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2018. LNCS, vol. 11324, pp. 152\u2013163. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04070-3_12"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-031-02462-7_10","volume-title":"Applications of Evolutionary Computation","author":"L Mariot","year":"2022","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., Leporati, A.: On the difficulty of evolving permutation codes. In: Jim\u00e9nez Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) EvoApplications 2022. LNCS, vol. 13224, pp. 141\u2013156. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-02462-7_10"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Mariot, L., Jakobovic, D., B\u00e4ck, T., Hernandez-Castro, J.: Artificial intelligence for the design of symmetric cryptographic primitives. In: Security and Artificial Intelligence, pp. 3\u201324 (2022)","DOI":"10.1007\/978-3-030-98795-4_1"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Mullen, G.L., Panario, D. (eds.): Handbook of Finite Fields, Discrete Mathematics and its Applications. CRC Press (2013)","DOI":"10.1201\/b15006"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Koetter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. In: IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, June 24\u201329, 2007, pp. 791\u2013795. IEEE (2007)","DOI":"10.1109\/ISIT.2007.4557321"},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11047-022-09885-3","volume":"21","author":"L Mariot","year":"2022","unstructured":"Mariot, L., Saletta, M., Leporati, A., Manzoni, L.: Heuristic search of (semi-)bent functions based on cellular automata. Nat. Comput. 21(3), 377\u2013391 (2022)","journal-title":"Nat. Comput."},{"key":"8_CR22","unstructured":"Luke, S.: Essentials of Metaheuristics. 2nd edn. Lulu (2015)"},{"key":"8_CR23","unstructured":"Moraglio, A., Poli, R.: Topological crossover for the permutation representation. In: Rothlauf, F., ed. Genetic and Evolutionary Computation Conference, GECCO 2005, Workshop Proceedings, Washington DC, USA, June 25\u201326, 2005, pp. 332\u2013338. ACM (2005)"},{"key":"8_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100646","volume":"54","author":"L Manzoni","year":"2020","unstructured":"Manzoni, L., Mariot, L., Tuba, E.: Balanced crossover operators in genetic algorithms. Swarm Evol. Comput. 54, 100646 (2020)","journal-title":"Swarm Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30035-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T09:21:47Z","timestamp":1729156907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30035-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300349","9783031300356"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30035-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}