On maximal spherical codes. I
The possibilities for attaining two Levenshtein upper bounds for spherical codes have been investigated. It is also shown that the fourth Levenshtein bound can be attained in some very special cases only. The authors have proved that no codes with an irrational maximal scalar product meet the third Levenshtein bound. They also investigate the nonexistence of several infinite families of maximal codes whose maximal scalar product is rational. Finally, the distance distributions of the only known nontrivial infinite family of maximal codes (due to Levenshtein) are given. For the entire collection see [Zbl 0847.00060].
- Complex spherical codes with three inner products
- Indexes of spherical codes
- Bounds for codes over the unit circle
- scientific article; zbMATH DE number 4047602 (Why is no real title available?)
- Iteratively maximum likelihood decodable spherical codes and a method for their construction
- scientific article; zbMATH DE number 1341365 (Why is no real title available?)
- Maximal circular codesversusmaximal codes
- scientific article; zbMATH DE number 2077080 (Why is no real title available?)
- scientific article; zbMATH DE number 800361 (Why is no real title available?)
- scientific article; zbMATH DE number 844679 (Why is no real title available?)
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
This page was built for publication: On maximal spherical codes. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352793)
