Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.
The design of permutation codes via a specialized maximum clique algorithm / Montemanni, Roberto; Barta, Janos; Smith Derek, H. - (2015), pp. 298-301. (Intervento presentato al convegno 2nd International Conference on Mathematics and Computers in Sciences and in Industry, MCSI 2015 tenutosi a Sliema, Malta nel AUG 17-19, 2015) [10.1109/MCSI.2015.54].
The design of permutation codes via a specialized maximum clique algorithm
Montemanni Roberto;
2015
Abstract
Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.
| File | Dimensione | Formato | |
|---|---|---|---|
|
07423981.pdf
Accesso riservato
Tipologia:
VOR - Versione pubblicata dall'editore
Dimensione
133.55 kB
Formato
Adobe PDF
|
133.55 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
