On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056)
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: On upper bounds for code distance and covering radius of designs in polynomial metric spaces |
scientific article; zbMATH DE number 753618
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On upper bounds for code distance and covering radius of designs in polynomial metric spaces |
scientific article; zbMATH DE number 753618 |
Statements
On upper bounds for code distance and covering radius of designs in polynomial metric spaces (English)
0 references
11 June 1995
0 references
Bounds are given for the code distance and the covering radius of designs in polynomial metric spaces. These bounds generalize the Norse bound for the covering radius of antipodal 2-designs in antipodal spaces. It is also shown that the bound is attained in the case of tight \(2k\)-designs in antipodal spaces. The results were obtained by solving an extremal problem for systems of orthogonal polynomials.
0 references
code distance
0 references
covering radius
0 references
designs
0 references
polynomial metric spaces
0 references
Norse bound
0 references
antipodal spaces
0 references
orthogonal polynomials
0 references
0 references
0 references
