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 | |
Publication status | Published - May 2014 |
Keywords
- Powerline communication
- Constant composition codes
- Frequency permutation arrays
- Neighbour transitive codes
- Permutation codes
- Automorphism groups