Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the design of permutation codes by evolutionary algorithms (EA) by developing an iterative approach. Starting from a single random permutation, new permutations satisfying the minimum distance constraint are incrementally added to the code by using a permutation-based EA. We investigate our approach against four different fitness functions targeting the minimum distance requirement at different levels of detail and with two different policies concerning code expansion and pruning. We compare the results achieved by our EA approach to those of a simple random search, remarking that neither method scales well with the problem size.

Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., & Leporati, A. (2022). On the Difficulty of Evolving Permutation Codes. In Proceedings of Applications of Evolutionary Computation, 25th European Conference, EvoApplications 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20–22, 2022 (pp.141-156). Cham : Springer Nature [10.1007/978-3-031-02462-7_10].

On the Difficulty of Evolving Permutation Codes

Mariot, L
;
Leporati, A
2022

Abstract

Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the design of permutation codes by evolutionary algorithms (EA) by developing an iterative approach. Starting from a single random permutation, new permutations satisfying the minimum distance constraint are incrementally added to the code by using a permutation-based EA. We investigate our approach against four different fitness functions targeting the minimum distance requirement at different levels of detail and with two different policies concerning code expansion and pruning. We compare the results achieved by our EA approach to those of a simple random search, remarking that neither method scales well with the problem size.
Si
paper
Scientifica
Block ciphers; Evolutionary algorithms; Flash memories; Incremental construction; Permutation codes; Powerline communications;
English
25th European Conference on the Applications of Evolutionary Computation, EvoApplications 2022 - 20 April 2022 through 22 April 2022
978-3-031-02461-0
Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., & Leporati, A. (2022). On the Difficulty of Evolving Permutation Codes. In Proceedings of Applications of Evolutionary Computation, 25th European Conference, EvoApplications 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20–22, 2022 (pp.141-156). Cham : Springer Nature [10.1007/978-3-031-02462-7_10].
Mariot, L; Picek, S; Jakobovic, D; Djurasevic, M; Leporati, A
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10281/385024
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
Social impact