Frequency permutation arrays

Sophie Huczynska, Gary L. Mullen

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


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 - mX and distance d is a set T of multipermutations on a multiset of m symbols, each repeated with frequency λ, such that the Hamming distance between any distinct x,y ∈ T is at least d. Such arrays have potential applications in powerline communication. In this article, 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.

Original languageEnglish (US)
Pages (from-to)463-478
Number of pages16
JournalJournal of Combinatorial Designs
Issue number6
StatePublished - Nov 2006

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Frequency permutation arrays'. Together they form a unique fingerprint.

Cite this