From Neighbour Transitive Codes to Frequency Permutation Arrays

Details From Neighbour Transitive Codes to Frequency Permutation Arrays From Neighbour Transitive Codes to Frequency Permutation Arrays

2012-04-13

arxiv.org/abs/1204.2900v1

Mathematics

Combinatorics

Scientific paper

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, and show that the only constant composition codes that can appear in this family are frequency permutation arrays, providing an infinitely family of examples.

Affiliated with

Also associated with

No associations

Rating

From Neighbour Transitive Codes to Frequency Permutation Arrays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with From Neighbour Transitive Codes to Frequency Permutation Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Neighbour Transitive Codes to Frequency Permutation Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143526