Constructions for permutation codes in powerline communications (Q1877339): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:desi.0000029212.52214.71 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066218472 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructions for permutation codes in powerline communications |
scientific article |
Statements
Constructions for permutation codes in powerline communications (English)
0 references
16 August 2004
0 references
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.
0 references
permutation code
0 references
permutation array
0 references
permutation polynomial
0 references
constant composition code
0 references
heuristic search
0 references
reactive local search
0 references
