A lower bound on permutation codes of distance \(n-1\) (Q2285776)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound on permutation codes of distance n-1 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on permutation codes of distance \(n-1\) |
scientific article |
Statements
A lower bound on permutation codes of distance \(n-1\) (English)
0 references
9 January 2020
0 references
permutation codes
0 references
idempotent Latin squares
0 references
Buchstab sieve
0 references
0 references
0 references
0.9060344
0 references
0.90570045
0 references
0.9040834
0 references
0.8958655
0 references
0.8898926
0 references
0.8873534
0 references
0.8869709
0 references
