Abstract
The design of binary error-correcting codes is a challenging optimization problem with several applications in telecommunications and storage, which has been addressed with metaheuristic techniques such as evolutionary algorithms. Still, all these efforts are focused on optimizing the minimum distance of unrestricted binary codes, i.e., with no constraints on their linearity, which is a desirable property for efficient implementations. In this paper, we present an Evolutionary Strategy (ES) algorithm that explores only the subset of linear codes of a fixed length and dimension. We represent the candidate solutions as binary matrices and devise variation operators that preserve their ranks. Our experiments show that up to length \(n=14\), our ES always converges to an optimal solution with a full success rate, and the evolved codes are all inequivalent to the Best-Known Linear Code (BKLC) given by MAGMA. On the other hand, for larger lengths, both the success rate of the ES as well as the diversity of the codes start to drop, with the extreme case of (16, 8, 5) codes which all turn out to be equivalent to MAGMA’s BKLC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
McEliece, R.J.: The Theory of Information and Coding. Number 86. Cambridge University Press (2004)
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–22, 1972, pp. 85–103. The IBM Research Symposia Series, Plenum Press, New York (1972)
Dontas, K., Jong, K.A.D.: Discovery of maximal distance codes using genetic algorithms. In: Proceedings of IEEE TAI 1990, pp. 805–811. IEEE Computer Society (1990)
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–337. ACM (1998)
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–136 (1998)
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–1142. ACM (2012)
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–123 (1987)
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–989. ACM (2004)
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–61. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24652-7_6
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–119 (2005)
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)
Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes (2007). http://www.codetables.de. Accessed 13 Nov 2022
Huffman, W.C., Pless, V.: Fundamentals of Error-correcting Codes. Cambridge University Press (2010)
Carlet, C.: Boolean functions for cryptography and coding theory (2021)
Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary search of binary orthogonal arrays. In: Auger, A., Fonseca, C.M., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 121–133. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99253-2_10
Knezevic, K., Picek, S., Mariot, L., Jakobovic, D., Leporati, A.: The design of (Almost) disjunct matrices by evolutionary algorithms. In: Fagan, D., Martín-Vide, C., O’Neill, M., Vega-Rodríguez, M.A. (eds.) TPNC 2018. LNCS, vol. 11324, pp. 152–163. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04070-3_12
Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., Leporati, A.: On the difficulty of evolving permutation codes. In: Jiménez Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) EvoApplications 2022. LNCS, vol. 13224, pp. 141–156. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-02462-7_10
Mariot, L., Jakobovic, D., Bäck, T., Hernandez-Castro, J.: Artificial intelligence for the design of symmetric cryptographic primitives. In: Security and Artificial Intelligence, pp. 3–24 (2022)
Mullen, G.L., Panario, D. (eds.): Handbook of Finite Fields, Discrete Mathematics and its Applications. CRC Press (2013)
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–29, 2007, pp. 791–795. IEEE (2007)
Mariot, L., Saletta, M., Leporati, A., Manzoni, L.: Heuristic search of (semi-)bent functions based on cellular automata. Nat. Comput. 21(3), 377–391 (2022)
Luke, S.: Essentials of Metaheuristics. 2nd edn. Lulu (2015)
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–26, 2005, pp. 332–338. ACM (2005)
Manzoni, L., Mariot, L., Tuba, E.: Balanced crossover operators in genetic algorithms. Swarm Evol. Comput. 54, 100646 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Carlet, C., Mariot, L., Manzoni, L., Picek, S. (2023). Evolutionary Strategies for the Design of Binary Linear Codes. In: Pérez Cáceres, L., Stützle, T. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2023. Lecture Notes in Computer Science, vol 13987. Springer, Cham. https://doi.org/10.1007/978-3-031-30035-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-30035-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30034-9
Online ISBN: 978-3-031-30035-6
eBook Packages: Computer ScienceComputer Science (R0)