scientific article; zbMATH DE number 2154097
From MaRDI portal
Publication:4664646
An \((n,M,s)\) spherical code is a nonempty finite subset of the \(n\)-dimensional Euclidean sphere \(\mathbb S^{n-1}\) of cardinality \(| C| =M\) and maximal inner product \(s=s(C)=\max\{\langle x,y\rangle:x,y\in C,\;x\neq y\}\). Certain invariants of spherical codes are introduced and investigated. They may be useful for obtaining linear programming bounds for spherical codes and designs. For the entire collection see [Zbl 0944.00096].
Recommendations
Cited in
(15)- Nonexistence of certain symmetric spherical codes
- On variations of designs
- On maximal antipodal spherical codes with few distances
- Extremal polynomials for obtaining bounds for spherical codes and designs
- Complex spherical codes with three inner products
- On polarization of spherical codes and designs
- Indexes of spherical codes
- Codes on Euclidean spheres
- Superimposed codes in \(\mathbb{R}^n\) obtained from spherical codes
- Finding and investigating exact spherical codes
- A spherical code
- Complex spherical codes with two inner products
- Linear Programming Bounds for Spherical (k,k)-Designs
- scientific article; zbMATH DE number 2237360 (Why is no real title available?)
- Uniqueness of the 120-point spherical 11-design in four dimensions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664646)