New Upper Bounds on the Size of Permutation Codes under Kendall $\tau$-Metric

Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari +3

We first give two methods based on the representation theory of symmetric groups to study the largest size $P(n,d)$ of permutation codes of length $n$ i.e. subsets of the set $S_n$…