Upper bounds on permutation codes via linear programming
Using linear programming, the theory of association schemes, and characters of the symmetric group on \(n\) symbols, the author derives an upper bound on the size (cardinality) of a permutation code of length \(n\) where the distance between every pair of distinct codewords comes from some specified set \(D\) of integers. Many numerical examples and tables are included.
scientific article; zbMATH DE number 1251354