Computing the Ball Size of Frequency Permutations under Chebyshev Distance

Let $S_n^{\lambda }$ be the set of all permutations over the multiset $\{\stackrel{\lambda }{\overbrace{1,\mathrm{.}\mathrm{.}\mathrm{.},1}},\mathrm{.}\mathrm{.}\mathrm{.},\stackrel{\lambda }{\overbrace{m,\mathrm{.}\mathrm{.}\mathrm{.},m}}\}$ where $n=m\lambda$. A frequency permutation array (FPA) of minimum distance $d$ is a subset of $S_n^{\lambda }$ in which every two elements have distance at least $d$. FPAs have many applications related to error correcting codes. In coding theory, the Gilbert-Varshamov bound and the sphere-packing bound are derived from the size of balls of certain radii. We propose two efficient algorithms that compute the ball size of frequency permutations under Chebyshev distance. Both methods extend previous known results. The first one runs in $O({2d\lambda \choose d\lambda}^{2.376}\log n)$timeand$O({2d\lambda \choose d\lambda}^{2})$space\mathrm{.}Thesecondonerunsin$O({2d\lambda \choose d\lambda}{d\lambda+\lambda\choose \lambda}\frac{n}{\lambda})$timeand$O({2d\lambda \choose d\lambda})$space\mathrm{.}Forsmallconstants$\lambda$and$d$, both are efficient in time and use constant storage space.