Diagonally neighbour transitive codes and frequency permutation arrays

Neil I Gillespie; Cheryl E. Praeger

doi:10.1007/s10801-013-0465-6

Diagonally neighbour transitive codes and frequency permutation arrays

Neil I Gillespie, Cheryl E. Praeger

Research output: Contribution to journal › Article (Academic Journal) › peer-review

8 Citations (Scopus)

272 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 language	English
Pages (from-to)	733-747
Number of pages	15
Journal	Journal of Algebraic Combinatorics
Volume	39
Issue number	3
Early online date	30 Aug 2013
DOIs	https://doi.org/10.1007/s10801-013-0465-6
Publication status	Published - May 2014

Keywords

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

Access to Document

10.1007/s10801-013-0465-6

Full-text PDF (accepted author manuscript)
This is the author accepted manuscript (AAM). The final published version (version of record) is available online via Springer at http://link.springer.com/article/10.1007%2Fs10801-013-0465-6. Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 194 KBLicence: Unspecified

Cite this

@article{0fa1ca76b07f42d6b2180d296324f53e,

title = "Diagonally neighbour transitive codes and frequency permutation arrays",

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.",

keywords = "Powerline communication, Constant composition codes, Frequency permutation arrays, Neighbour transitive codes, Permutation codes, Automorphism groups",

author = "Gillespie, {Neil I} and Praeger, {Cheryl E.}",

year = "2014",

month = may,

doi = "10.1007/s10801-013-0465-6",

language = "English",

volume = "39",

pages = "733--747",

journal = "Journal of Algebraic Combinatorics",

issn = "0925-9899",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Diagonally neighbour transitive codes and frequency permutation arrays

AU - Gillespie, Neil I

AU - Praeger, Cheryl E.

PY - 2014/5

Y1 - 2014/5

N2 - 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.

AB - 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.

KW - Powerline communication

KW - Constant composition codes

KW - Frequency permutation arrays

KW - Neighbour transitive codes

KW - Permutation codes

KW - Automorphism groups

U2 - 10.1007/s10801-013-0465-6

DO - 10.1007/s10801-013-0465-6

M3 - Article (Academic Journal)

VL - 39

SP - 733

EP - 747

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

SN - 0925-9899

IS - 3

ER -

Diagonally neighbour transitive codes and frequency permutation arrays

Abstract

Keywords

Access to Document

Fingerprint

Cite this