A branch and bound approach to permutation codes

Janos Barta, Roberto Montemanni, Derek H. Smith

Research output: Contribution to conferenceOtherpeer-review

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.
Original languageEnglish
Pages187-192
DOIs
Publication statusPublished - May 2014
Event2014 2nd International Conference on Information and Communication Technology (ICoICT) - Bandung, Indonesia
Duration: 28 May 201430 May 2014

Conference

Conference2014 2nd International Conference on Information and Communication Technology (ICoICT)
Period28/05/1430/05/14

Fingerprint

Dive into the research topics of 'A branch and bound approach to permutation codes'. Together they form a unique fingerprint.

Cite this