Frequency permutation arrays
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(13)- Increasing the minimum distance of codes by twisting
- Equidistant permutation group codes
- Construction of the mutually orthogonal extraordinary supersquares
- Room squares with super-simple property
- Diagonally neighbour transitive codes and frequency permutation arrays
- On constant composition codes
- Computing the ball size of frequency permutations under Chebyshev distance
- Optimal ternary constant-composition codes with weight four and distance six
- scientific article; zbMATH DE number 7790332 (Why is no real title available?)
- Equidistant frequency permutation arrays and related constant composition codes
- A construction of optimal constant composition codes
- Finite field constructions of combinatorial arrays
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
This page was built for publication: Frequency permutation arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419700)
