Frequency permutation arrays

Simple item page
dc.creatorHuczynska, Sophie
dc.creatorMullen, Gary L.
dc.date2005-11-07
dc.date.accessioned2026-07-07T06:50:55Z
dc.date.available2026-07-07T06:50:55Z
dc.descriptionMotivated 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.
dc.descriptionTo appear in Journal of Combinatorial Designs
dc.identifierhttps://arxiv.org/abs/math/0511173
dc.identifierhttp://arxiv.org/abs/math/0511173
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104816
dc.subjectCombinatorics
dc.subject94A29; 94A05
dc.titleFrequency permutation arrays
dc.typetext

Files

Collections

arXiv