Add to ORKGThis 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
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Error-correcting codes with n binary digits per code word are considered, in which the distances are...
This paper deals with permutation codes. These codes have a main application in error correction in ...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
A considerable amount of research has been devoted to permutation codes in recent years. This has be...
A considerable amount of research has been devoted to permutation codes in recent years. This has be...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
A permutation code can be represented as a graph, in which the nodes correspond to the permutation c...
A permutation code can be represented as a graph, in which the nodes correspond to the permutation c...
Permutation codes (or permutation arrays) have received considerable interest in recent years, partl...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Error-correcting codes with n binary digits per code word are considered, in which the distances are...
This paper deals with permutation codes. These codes have a main application in error correction in ...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
A considerable amount of research has been devoted to permutation codes in recent years. This has be...
A considerable amount of research has been devoted to permutation codes in recent years. This has be...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
A permutation code can be represented as a graph, in which the nodes correspond to the permutation c...
A permutation code can be represented as a graph, in which the nodes correspond to the permutation c...
Permutation codes (or permutation arrays) have received considerable interest in recent years, partl...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Error-correcting codes with n binary digits per code word are considered, in which the distances are...