An extremum problem for polynomials and bounds for codes with given distance and diameter (Q596963)
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: An extremum problem for polynomials and bounds for codes with given distance and diameter |
scientific article; zbMATH DE number 2082400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extremum problem for polynomials and bounds for codes with given distance and diameter |
scientific article; zbMATH DE number 2082400 |
Statements
An extremum problem for polynomials and bounds for codes with given distance and diameter (English)
0 references
6 August 2004
0 references
Lloyd-type theorems
0 references
polynomial metric spaces
0 references
code distance
0 references
diameter
0 references
annihilating polynomial
0 references
0.9357454
0 references
0.9117424
0 references
0.90308106
0 references
0.8981675
0 references
0.89332867
0 references
0.88916206
0 references
