Permutation codes (or permutation arrays) have received considerable interest in recent years, partly motivated by a potential application to powerline communication. Powerline communication is the transmission of data over the electricity distribution system. This environment is rather hostile to communication and the requirements are such that permutation codes may be suitable. The problem addressed in this study is the construction of permutation codes with a specified length and minimum Hamming distance, and with as many codewords (permutations) as possible. A number of techniques are used including construction by automorphism group and several variations of clique search based on vertex degrees. Many significant improvements are obtai...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
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 (...
In this survey paper, we explore the interactions between mathematics and engineering inspired by th...
In this survey paper, we explore the interactions between mathematics and engineering inspired by th...
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...
Permutation codes have received considerable interest in recent years, motivated by some real-world ...
Permutation codes have received considerable interest in recent years, motivated by some real-world ...
This paper deals with permutation codes. These codes have a main application in error correction in ...
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...
We partition permutation sequences into groups to form permutation codes for multiuser communication...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
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 (...
In this survey paper, we explore the interactions between mathematics and engineering inspired by th...
In this survey paper, we explore the interactions between mathematics and engineering inspired by th...
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...
Permutation codes have received considerable interest in recent years, motivated by some real-world ...
Permutation codes have received considerable interest in recent years, motivated by some real-world ...
This paper deals with permutation codes. These codes have a main application in error correction in ...
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...
We partition permutation sequences into groups to form permutation codes for multiuser communication...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...