Permutation codes:  a new upper bound for M(7,5)

Roberto Montemanni; Janos Barta; Derek H. Smith

doi:10.15242/IAE.IAE1214003

Permutation codes: a new upper bound for M(7,5)

Roberto Montemanni, Janos Barta, Derek H. Smith

Faculty of Computing, Engineering and Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper deals with permutation codes. These codes
have a main application in error correction in telecommunications.
An algorithm based on combinatorial optimization concepts such as
branch and bound, and graph theoretical concepts such as graph
isomorphism, is discussed. The new theoretical result M(7,5) ≤ 122,
obtained by this approach, is finally disclosed.

Original language	English
Title of host publication	2014 International Conference on Informatics and Advanced Computing
Number of pages	4
DOIs	https://doi.org/10.15242/IAE.IAE1214003
Publication status	Published - 2014
Event	2014 International Conference on Informatics and Advanced Computing - Bangkok, Thailand Duration: 30 Dec 2014 → 31 Dec 2014

Conference

Conference	2014 International Conference on Informatics and Advanced Computing
Abbreviated title	ICIAC-14
Country/Territory	Thailand
City	Bangkok
Period	30/12/14 → 31/12/14

Keywords

Branch and bound algorithms
Upper bounds
permutation codes

Access to Document

10.15242/IAE.IAE1214003Licence: CC BY-NC-ND

Cite this

@inproceedings{dbc2587d028746f09ae5b4dd1760a055,

title = "Permutation codes: a new upper bound for M(7,5) ",

abstract = "This paper deals with permutation codes. These codeshave a main application in error correction in telecommunications.An algorithm based on combinatorial optimization concepts such asbranch and bound, and graph theoretical concepts such as graphisomorphism, is discussed. The new theoretical result M(7,5) ≤ 122,obtained by this approach, is finally disclosed. ",

keywords = "Branch and bound algorithms, Upper bounds, permutation codes",

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

year = "2014",

doi = "10.15242/IAE.IAE1214003",

language = "English",

booktitle = "2014 International Conference on Informatics and Advanced Computing",

note = "2014 International Conference on Informatics and Advanced Computing, ICIAC-14 ; Conference date: 30-12-2014 Through 31-12-2014",

}

TY - GEN

T1 - Permutation codes

T2 - 2014 International Conference on Informatics and Advanced Computing

AU - Montemanni, Roberto

AU - Barta, Janos

AU - Smith, Derek H.

PY - 2014

Y1 - 2014

N2 - This paper deals with permutation codes. These codeshave a main application in error correction in telecommunications.An algorithm based on combinatorial optimization concepts such asbranch and bound, and graph theoretical concepts such as graphisomorphism, is discussed. The new theoretical result M(7,5) ≤ 122,obtained by this approach, is finally disclosed.

AB - This paper deals with permutation codes. These codeshave a main application in error correction in telecommunications.An algorithm based on combinatorial optimization concepts such asbranch and bound, and graph theoretical concepts such as graphisomorphism, is discussed. The new theoretical result M(7,5) ≤ 122,obtained by this approach, is finally disclosed.

KW - Branch and bound algorithms

KW - Upper bounds

KW - permutation codes

U2 - 10.15242/IAE.IAE1214003

DO - 10.15242/IAE.IAE1214003

M3 - Conference contribution

BT - 2014 International Conference on Informatics and Advanced Computing

Y2 - 30 December 2014 through 31 December 2014

ER -