Frequency permutation arrays

Details Frequency permutation arrays Frequency permutation arrays

2005-11-07

arxiv.org/abs/math/0511173v1

Mathematics

Combinatorics

To appear in Journal of Combinatorial Designs

Scientific paper

Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n=m lambda and distance d is a set T of multipermutations on a multiset of m symbols, each repeated with frequency lambda, such that the Hamming distance between any distinct x,y in T is at least d. Such arrays have potential applications in powerline communication. In this paper, we establish basic properties of FPAs, and provide direct constructions for FPAs using a range of combinatorial objects, including polynomials over finite fields, combinatorial designs, and codes. We also provide recursive constructions, and give bounds for the maximum size of such arrays.

Affiliated with

Also associated with

No associations

Rating

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 Frequency permutation arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Frequency permutation arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-336542