New Bounds on the Size of Permutation Codes With Minimum Kendall ττ-distance of Three

preprint2022arXivOpen access

Abstract

We study P(n,3)P(n,3), the size of the largest subset of the set of all permutations SnS_n with minimum Kendall ττ-distance 33. Using a combination of group theory and integer programming, we reduced the upper bound of P(p,3)P(p,3) from (p−1)!−1(p-1)!-1 to (p−1)!−⌈p3⌉+2≤(p−1)!−2(p-1)!-\lceil\frac{p}{3}\rceil+2\leq (p-1)!-2 for all primes p≥11p\geq 11. In special cases where nn is equal to 6,7,11,13,14,156,7,11,13,14,15 and 1717 we reduced the upper bound of P(n,3)P(n,3) by 3,3,9,11,1,13,3,9,11,1,1 and 44, respectively.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.