Constructions for permutation codes in powerline communications
Permutation codes do not enjoy the popularity of binary codes though these have been studied for many years, and have been found useful in powerline communication. In this paper, several new computational constructions of permutation codes are given. Most of these make use of automorphism groups. It is shown that certain families of polynomials over finite fields give rise to permutation arrays. The main result of the paper is a recursive construction of such arrays for codes with constant weight composition. A listing and comparison of various old and new lower bounds of such a study is provided.
scientific article; zbMATH DE number 2091505