Diagonally neighbour transitive codes and frequency permutation arrays |
| |
Authors: | Neil I. Gillespie Cheryl E. Praeger |
| |
Affiliation: | 1. Centre for the Mathematics of Symmetry and Computation, School of Mathematics and Statistics, University of Western Australia, Crawley, Australia 2. King Abdulaziz University, Jeddah, Saudi Arabia
|
| |
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: | |
本文献已被 SpringerLink 等数据库收录! |
|