Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays
Combinatorics
2014-04-04 v2
Abstract
Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication. 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
Cite
@article{arxiv.1204.2900,
title = {Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays},
author = {Neil I. Gillespie and Cheryl E. Praeger},
journal= {arXiv preprint arXiv:1204.2900},
year = {2014}
}