Upper bounds on permutation codes via linear programming (Q1279874): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/eujc.1998.0272 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018972846 / rank | |||
Normal rank | |||
Latest revision as of 18:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on permutation codes via linear programming |
scientific article |
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
