Diagonally neighbour transitive codes and frequency permutation arrays

@article{Gillespie2014DiagonallyNT,
  title={Diagonally neighbour transitive codes and frequency permutation arrays},
  author={Neil I. Gillespie and C. Praeger},
  journal={Journal of Algebraic Combinatorics},
  year={2014},
  volume={39},
  pages={733-747}
}
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… Expand

Tables from this paper

Twisted permutation codes
CHARACTERISATION OF A FAMILY OF NEIGHBOUR TRANSITIVE CODES
ELUSIVE CODES IN HAMMING GRAPHS
Minimal binary 2-neighbour-transitive codes
Uniqueness of certain completely regular Hadamard codes
Alphabet-almost-simple 2-neighbour-transitive codes
...
1
2
...

References

SHOWING 1-10 OF 27 REFERENCES
Constructions for Permutation Codes in Powerline Communications
On constant composition codes
Frequency permutation arrays
Neighbour transitivity on codes in Hamming graphs
Permutation codes with specified packing radius
Coding with injections
  • P. Dukes
  • Computer Science, Mathematics
  • Des. Codes Cryptogr.
  • 2012
Permutation modulation
Error-correcting codes from permutation groups
  • R. Bailey
  • Computer Science, Mathematics
  • Discret. Math.
  • 2009
Permutation codes for discrete channels (Corresp.)
  • I. Blake
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 1974
...
1
2
3
...