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.
Permutation codes: a new upper bound for M (7, 5) / Montemanni, Roberto; Barta, Janos; Smith Derek, H. - (2014), pp. 1-3. (Intervento presentato al convegno International conference on informatics and advanced computing 2014 tenutosi a Bangkok nel December 2014).
Permutation codes: a new upper bound for M (7, 5)
Montemanni Roberto;
2014
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.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
