A branch and bound approach to permutation codes

Janos Barta; Roberto Montemanni; Derek H. Smith

doi:10.1109/ICoICT.2014.6914063

A branch and bound approach to permutation codes

Janos Barta, Roberto Montemanni, Derek H. Smith

Faculty of Computing, Engineering and Science

Research output: Contribution to conference › Other › peer-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 language	English
Pages	187-192
DOIs	https://doi.org/10.1109/ICoICT.2014.6914063
Publication status	Published - May 2014
Event	2014 2nd International Conference on Information and Communication Technology (ICoICT) - Bandung, Indonesia Duration: 28 May 2014 → 30 May 2014

Conference

Conference	2014 2nd International Conference on Information and Communication Technology (ICoICT)
Period	28/05/14 → 30/05/14

Access to Document

10.1109/ICoICT.2014.6914063Licence: CC BY-NC-ND

Cite this

@conference{9e9ec2ab2efc4a81910fcd854927da4f,

title = "A branch and bound approach to permutation codes",

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.",

author = "Janos Barta and Roberto Montemanni and Smith, {Derek H.}",

year = "2014",

month = may,

doi = "10.1109/ICoICT.2014.6914063",

language = "English",

pages = "187--192",

note = "2014 2nd International Conference on Information and Communication Technology (ICoICT) ; Conference date: 28-05-2014 Through 30-05-2014",

}

TY - CONF

T1 - A branch and bound approach to permutation codes

AU - Barta, Janos

AU - Montemanni, Roberto

AU - Smith, Derek H.

PY - 2014/5

Y1 - 2014/5

N2 - 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.

AB - 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.

U2 - 10.1109/ICoICT.2014.6914063

DO - 10.1109/ICoICT.2014.6914063

M3 - Other

SP - 187

EP - 192

T2 - 2014 2nd International Conference on Information and Communication Technology (ICoICT)

Y2 - 28 May 2014 through 30 May 2014

ER -

A branch and bound approach to permutation codes

Abstract

Conference

Access to Document

Fingerprint

Cite this