Constructions for permutation codes in powerline communications

Wensong Chu, Charles Colbourn, Peter Dukes

Research output: Contribution to journalArticle

96 Scopus citations

Abstract

A permutation array (or code) of length n and distance d is a set Γ of permutations from some fixed set of n symbols such that the Hamming distance between each distinct x, y ∈ Γ is at least d. One motivation for coding with permutations is powerline communication. After summarizing known results, it is shown here that certain families of polynomials over finite fields give rise to permutation arrays. Additionally, several new computational constructions are given, often making use of automorphism groups. Finally, a recursive construction for permutation arrays is presented, using and motivating the more general notion of codes with constant weight composition.

Original languageEnglish (US)
Pages (from-to)51-64
Number of pages14
JournalDesigns, Codes, and Cryptography
Volume32
Issue number1-3
DOIs
StatePublished - May 1 2004

Keywords

  • Constant composition code
  • Heuristic search
  • Permutation array
  • Permutation code
  • Permutation polynomial
  • Reactive local search

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Constructions for permutation codes in powerline communications'. Together they form a unique fingerprint.

  • Cite this