The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in coding theory. The aim is to generate the largest possible permutation codes, having a given length n and a minimum Hamming distance d between the codewords. In this paper we present a new branch and bound algorithm, which combines combinatorial techniques with an approach based on group orbits. Computational experiments lead to interesting considerations about the use of group orbits for code generation.

A branch and bound approach to permutation codes / Barta, Janos; Montemanni, Roberto; Smith Derek, H. - (2014), pp. 187-192. (Intervento presentato al convegno 2014 2nd International Conference on Information and Communication Technology (ICoICT) tenutosi a Bali Indonesia nel May 2014) [10.1109/ICoICT.2014.6914063].

A branch and bound approach to permutation codes

Montemanni Roberto;
2014

Abstract

The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in coding theory. The aim is to generate the largest possible permutation codes, having a given length n and a minimum Hamming distance d between the codewords. In this paper we present a new branch and bound algorithm, which combines combinatorial techniques with an approach based on group orbits. Computational experiments lead to interesting considerations about the use of group orbits for code generation.
2014
2014 2nd International Conference on Information and Communication Technology (ICoICT)
Bali Indonesia
May 2014
187
192
Barta, Janos; Montemanni, Roberto; Smith Derek, H
A branch and bound approach to permutation codes / Barta, Janos; Montemanni, Roberto; Smith Derek, H. - (2014), pp. 187-192. (Intervento presentato al convegno 2014 2nd International Conference on Information and Communication Technology (ICoICT) tenutosi a Bali Indonesia nel May 2014) [10.1109/ICoICT.2014.6914063].
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
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

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1175991
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 1
social impact