Upper bounds on permutation codes via linear programming
European Journal of Combinatorics
A new algorithm for the maximum-weight clique problem
Nordic Journal of Computing
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Constructions for Permutation Codes in Powerline Communications
Designs, Codes and Cryptography
Heuristic algorithms for constructing binary constant weight codes
IEEE Transactions on Information Theory
Bounds on permutation codes of distance four
Journal of Algebraic Combinatorics: An International Journal
Constructing transitive permutation groups
Journal of Symbolic Computation
Permutation arrays for powerline communication and mutually orthogonal latin squares
IEEE Transactions on Information Theory
Power line communications: state of the art and future trends
IEEE Communications Magazine
| Hi-index | 0.00 |
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 obtained to the size of the best known codes.