Permutation arrays under the Chebyshev metric have been considered for error correction in noisy channels. Let $P(n,d)$ denote the maximum size of any array of permutations on $n$ symbols with pairwise Chebyshev distance $d$. We give new techniques and improved upper and lower bounds on $P(n,d)$, including a precise formula for $P(n,2)$.

翻译：在噪声信道中的纠错问题中，切比雪夫度量下的置换阵列已被考虑。设$P(n,d)$表示在$n$个符号上任意两两之间切比雪夫距离为$d$的置换阵列的最大规模。我们给出了新的技术以及关于$P(n,d)$的改进上下界，其中包括$P(n,2)$的精确公式。