Constructions for permutation codes in powerline communications
type: Item
instance of: scholarly article
title: Constructions for permutation codes in powerline communications
zbMATH Open document ID: 1065.94003
DOI: 10.1023/B:DESI.0000029212.52214.71
author: Wensong Chu
author: Charles J. Colbourn
author: Peter Dukes
published in: Designs, Codes and Cryptography
publication date: 2004-08-16T00:00:00Z
review text: 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.
reviewed by: Bai Kishan Dass
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 2091505
zbMATH Keywords: permutation code
zbMATH Keywords: permutation array
zbMATH Keywords: permutation polynomial
zbMATH Keywords: constant composition code
zbMATH Keywords: heuristic search
zbMATH Keywords: reactive local search
MaRDI profile type: Publication
full work available at URL: b:desi.0000029212.52214.71
OpenAlex ID: W2066218472
Recommended article: LDPC code design for nonuniform power-line channels
Recommended article: Improving a power line communications standard with LDPC codes
Recommended article: Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
Recommended article: On the performance of permutation codes for multi-user communication
Recommended article: Codes in Permutations and Error Correction for Rank Modulation
Recommended article: Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Recommended article: An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel (Corresp.)
Recommended article: Permutation codes for the Laplacian source (Corresp.)
description: scientific article; zbMATH DE number 2091505