New upper bounds on the size of permutation codes under Kendall τ -metric
arXiv (Cornell University)(2023)
摘要
We give two methods that are 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 of all permutations on {1,… ,n} with the minimum distance (at least) d under the Kendall τ -metric. The first method is an integer programming problem obtained from the transitive actions of S_n . The second method can be applied to refute the existence of perfect codes in S_n . Applying these methods, we reduce the known upper bound (n-1)!-1 for P ( n , 3) to (n-1)!-⌈n/3⌉ +2≤ (n-1)!-2 , whenever n≥ 11 is prime. If n=6 , 7, 11, 13, 14, 15, 17, the known upper bound for P ( n , 3) is decreased by 3, 3, 9, 11, 1, 1, 4, respectively.
更多查看译文
关键词
Kendall \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau$$\end{document} -metric
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要