Diagonally neighbour transitive codes and frequency permutation arrays

Neil I Gillespie, Cheryl E. Praeger

Research output: Contribution to journalArticle (Academic Journal)peer-review

8 Citations (Scopus)
300 Downloads (Pure)

Abstract

Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication, while at the same time maintaining a constant power output. In particular, a certain class of constant composition codes called frequency permutation arrays have been suggested as ideal, in some sense, for these purposes. In this paper we characterise a family of neighbour transitive codes in Hamming graphs in which frequency permutation arrays play a central rode. We also classify all the permutation codes generated by groups in this family.
Original languageEnglish
Pages (from-to)733-747
Number of pages15
JournalJournal of Algebraic Combinatorics
Volume39
Issue number3
Early online date30 Aug 2013
DOIs
Publication statusPublished - May 2014

Keywords

  • Powerline communication
  • Constant composition codes
  • Frequency permutation arrays
  • Neighbour transitive codes
  • Permutation codes
  • Automorphism groups

Fingerprint Dive into the research topics of 'Diagonally neighbour transitive codes and frequency permutation arrays'. Together they form a unique fingerprint.

Cite this