On the Difficulty of Evolving Permutation Codes

Autor: Mariot, Luca, Picek, Stjepan, Jakobović, Domagoj, Đurasević, Marko, Leporati, Alberto

Publikováno v: Laredo, J.L. Jiménez (ed.), Applications of Evolutionary Computation: 25th European Conference, EvoApplications 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20–22, 2022, Proceedings, pp. 141-156
Applications of Evolutionary Computation ISBN: 9783031024610

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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42dedef22a1187a6d8a20b04f09a675a
https://repository.ubn.ru.nl/handle/2066/250791

A note on good permutation codes from Reed–Solomon codes

Autor: Javad Bagherian, Alireza Abdollahi, Maryam Khatami, Reza Sobhani

Publikováno v: Designs, Codes and Cryptography. 87:2335-2340

Let M(n, d) be the maximum size of a permutation code of length n and distance d. In this note, the permutation codewords of a classical code C are considered. These are the codewords with all different entries in C. Using these codewords for Reed–

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5d8257febfcb26178f0a4a5f558edc35
https://doi.org/10.1007/s10623-019-00621-0

Are random permutations spherically uniform?

Autor: Michael D. Perlman

Publikováno v: Electron. J. Probab.

For large $q$, does the (discrete) uniform distribution on the set of $q!$ permutations of the vector $\bar{\mathbf {x}} ^{q}=(1,2,\dots ,q)'$ closely approximate the (continuous) uniform distribution on the $(q-2)$-sphere that contains them? These p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43c38c972430753726630220a8426185
https://projecteuclid.org/euclid.ejp/1580267009

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Some new resolvable GDDs with k=4 and doubly resolvable GDDs with k=3

Autor: Juan Du, Jinhua Wang, R. Julian R. Abel

Publikováno v: Discrete Mathematics. 338:2105-2118

A doubly resolvable packing design with block size k , index λ , replication number r , and v elements is called a generalized Kirkman square and denoted by GKS k ( v ; 1 , λ ; r ) . Existence of GKS 3 ( 4 u ; 1 , 1 ; 2 ( u - 1 ) ) s and GKS 3 ( 6

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::69e1d6621dc43d469fdd940df45d8131
https://doi.org/10.1016/j.disc.2015.05.008