Frequency permutation arrays

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
To appear in Journal of Combinatorial Designs

Keywords

Combinatorics, 94A29; 94A05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/104816

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0511173
 http://arxiv.org/abs/math/0511173

Collections

arXiv