A branch and bound approach to permutation codes

Janos Barta, Roberto Montemanni, Derek H. Smith

Allbwn ymchwil: Cyfraniad at gynhadleddAralladolygiad gan gymheiriaid

Crynodeb

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.
Iaith wreiddiolSaesneg
Tudalennau187-192
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - Mai 2014
Digwyddiad2014 2nd International Conference on Information and Communication Technology (ICoICT) - Bandung, Indonesia
Hyd: 28 May 201430 May 2014

Cynhadledd

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

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'A branch and bound approach to permutation codes'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn