FPA generalizes the notion of permutation array. In this paper, under the Chebyshev distance, we first prove lower and upper bounds on the size of FPA. Then we ...

Oct 22, 2024 · FPA generalizes the notion of permutation array. In this paper, under the Chebyshev distance, we first prove lower and upper bounds on the size ...

and distance is a set of permutations on a multiset over symbols, where each symbol appears exactly times and the dis- tance between any two elements in the ...

FPA generalizes the notion of permutation array. In this paper, under the Chebyshev distance, we first prove lower and upper bounds on the size of FPA. Then we ...

In this paper, under the Chebyshev distance, we first prove lower and upper bounds on the size of FPA. Then we give several constructions of FPAs, and some of ...

This work proposes two efficient algorithms that compute the ball size of frequency permutations under Chebyshev distance and shows that both are efficient in ...

Technically, with l∞ norm, we find it is much easier to encode, decode and estimate the sphere size of permutation arrays than with the other lp norms. In this ...

We propose two efficient algorithms that compute the ball size of frequency permutations under Chebyshev distance. Both methods extend previous known results.

In this paper, we establish connections between two different graph representations of permutations, which allows us to compute the distance of a few nontrivial ...

Decoding frequency permutation arrays under Chebyshev distance. A frequency permutation array (FPA) of length n = mλ and distance d is a set of permutations ...