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

Roberto Montemanni, Janos Barta, Derek H. Smith

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

Crynodeb

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.
Iaith wreiddiolSaesneg
Teitl2014 International Conference on Informatics and Advanced Computing
Nifer y tudalennau4
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 2014
Digwyddiad2014 International Conference on Informatics and Advanced Computing - Bangkok, Gwlad Thai
Hyd: 30 Dec 201431 Dec 2014

Cynhadledd

Cynhadledd2014 International Conference on Informatics and Advanced Computing
Teitl crynoICIAC-14
Gwlad/TiriogaethGwlad Thai
DinasBangkok
Cyfnod30/12/1431/12/14

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Permutation codes: a new upper bound for M(7,5)'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn