New Bounds on the Size of Permutation Codes With Minimum Kendall $\tau$-distance of Three

A. Abdollahi, J. Bagherian, F. Jafari +3

We study $P(n,3)$, the size of the largest subset of the set of all permutations $S_n$ with minimum Kendall $\tau$-distance $3$. Using a combination of group theory and integer progra…