Upper bounds on permutation codes via linear programming (Q1279874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1251354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on permutation codes via linear programming |
scientific article; zbMATH DE number 1251354 |
Statements
Upper bounds on permutation codes via linear programming (English)
0 references
13 April 1999
0 references
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.
0 references
permutation codes
0 references
association schemes
0 references
linear programming
0 references
0.92655211687088
0 references
0.8477537035942078
0 references
0.8322035074234009
0 references
0.7980075478553772
0 references
