DocumentCode
260330
Title
A branch and bound approach to permutation codes
Author
Barta, Jan ; Montemanni, Roberto ; Smith, Derek H.
Author_Institution
Dalle Molle Inst. for Artificial Intell., Univ. of Appl. Sci. of Southern Switzerland, Manno, Switzerland
fYear
2014
fDate
28-30 May 2014
Firstpage
187
Lastpage
192
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.
Keywords
Hamming codes; computational complexity; optimisation; tree searching; MPCP; branch and bound approach; codewords; combinatorial techniques; group orbits; maximum permutation code problem; minimum Hamming distance; optimization problem; Generators; Hamming distance; Orbits; Partitioning algorithms; Silicon; Tin; Upper bound; Coding theory; combinatorial optimization; permutation codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Communication Technology (ICoICT), 2014 2nd International Conference on
Conference_Location
Bandung
Type
conf
DOI
10.1109/ICoICT.2014.6914063
Filename
6914063
Link To Document