Permutation codes: a branch and bound approach

Roberto Montemanni, Janos Barta, Derek H. Smith

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

Crynodeb

This paper presents a new approach for retrieving
largest possible permutation codes. These have applications in
error correction for telecommunication purposes. The method
presented is based on combinatorial optimization concepts such
as branch and bound techniques and incorporates new adhoc
theoretical results. It is shown how the method can be
applied to obtain new results for subproblems. These results for
subproblems can be combined with other theoretical results to
obtain new results for complete instances. It is shown how the
new improved upper bound M(7,5) ≤ 124 can be obtained with
such techniques.
Iaith wreiddiolSaesneg
TeitlADVANCES in APPLIED and PURE MATHEMATICS
Is-deitlProceedings of the 2014 International Conference on Pure Mathematics, Applied Mathematics, Computational Methods (PMAMCM 2014)
Tudalennau86-90
Nifer y tudalennau4
StatwsCyhoeddwyd - 17 Gorff 2014
Digwyddiad2014 International Conference on Pure Mathematics, Applied Mathematics, Computational Methods - Santorini Island, Groeg
Hyd: 17 Gorff 201421 Gorff 2014

Cyfres gyhoeddiadau

EnwMathematics and Computers in Science and Engineering Series
Cyfrol29
ISSN (Argraffiad)2227-4588

Cynhadledd

Cynhadledd2014 International Conference on Pure Mathematics, Applied Mathematics, Computational Methods
Teitl crynoPMAMCM 2014
Gwlad/TiriogaethGroeg
DinasSantorini Island
Cyfnod17/07/1421/07/14

Ôl bys

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

Dyfynnu hyn