Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms

Roberto Montemanni, János Barta, Derek H. Smith

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddCyfraniad i bennod aralladolygiad gan gymheiriaid


A considerable amount of research has been devoted to permutation codes in recent years. This has been motivated by some real-world applications. Permutation codes are important because of their robustness against transmission errors and noise. This study addresses the problem of the construction of the largest possible permutation codes with given parameters, namely a specified length and minimum Hamming distance. The problem is modelled in terms of maximum cliques and it is shown how a well-known upper bound based on colouring can be successfully embedded inside a branch and bound method. Experimental results are presented to evaluate the effectiveness of the new idea.

Iaith wreiddiolSaesneg
TeitlNew Advances in Information Systems and Technologies
GolygyddionÁlvaro Rocha, Ana Maria Correia, Hojjat Adeli, Luis Paulo Reis, Marcelo Mendonça Teixeira
ISBN (Electronig)978-3-319-31232-3
ISBN (Argraffiad)978-3-319-31231-6
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 2 Maw 2016

Cyfres gyhoeddiadau

EnwAdvances in Intelligent Systems and Computing
ISSN (Argraffiad)2194-5357
ISSN (Electronig)2194-5365

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn