Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph (Q5264765)
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 6466120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph |
scientific article; zbMATH DE number 6466120 |
Statements
Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph (English)
0 references
27 July 2015
0 references
Hamming graph
0 references
Krawtchouk polynomial
0 references
Kravchuk polynomial
0 references
1-perfect bitrade
0 references
0.916503608226776
0 references
0.8671739101409912
0 references
0.7649418711662292
0 references
0.7587751746177673
0 references
0.7390335202217102
0 references
