Upper bounds on permutation codes via linear programming

Abstract

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n ≤ 8 are tabulated. It turns out that, for n ≤ 8, the Kiyota bound for group codes also holds for unrestricted codes at least in 178 cases. Also an easier (but weaker) polynomial version of the bound is given. It is obtained by showing that the mappings Fk(θ) (0 ≤ k ≤ n/2), where Fk is the Charlier polynomial of degree k and θ the natural character of the symmetric group Sn, are mutually orthogonal characters of Sn. © 1999 Academic Press.