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 ) 表示具有成对切比雪夫距离d的n 个符号上的任何排列数组的最大大小。我们给出了P ( n ,  d )的新技术和改进的上限和下限，包括P ( n , 2)的精确公式。