Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes. (English) Zbl 1439.94105
Kabatiansky, Grigory (ed.) et al., Algebraic and combinatorial coding theory – 2016. Selected papers from the 15th international workshop (ACCT-XV), Albena, Bulgaria, June 18–24, 2016. Amsterdam: Elsevier. Electron. Notes Discrete Math. 57, 91-96 (2017).
Summary: In this paper we introduce a framework for improvement of universal lower bounds on potential energy using the Delsarte-Yudin linear programming approach for polynomials. As a model example we consider the case of 24 points on \(\mathbb{S}^3\).
For the entire collection see [Zbl 1375.94013].
For the entire collection see [Zbl 1375.94013].
MSC:
| 94B27 | Geometric methods (including applications of algebraic geometry) applied to coding theory |
| 94B65 | Bounds on codes |
References:
| [1] | Boyvalenkov, P.; Dragnev, P.; Hardin, D.; Saff, E.; Stoyanova, M., Universal lower bounds for potential energy of spherical codes, Constr. Approx. (2016) · Zbl 1404.94154 |
| [2] | Cohn, H.; Conway, J.; Elkies, N.; Kumar, A., The \(D_4\) root system is not universally optimal, Experiment. Math., 16, 313-320 (2007) · Zbl 1137.05020 |
| [3] | Cohn, H.; Kumar, A., Universally optimal distribution of points on spheres, J. Amer. Math. Soc., 20, 99-148 (2006) · Zbl 1198.52009 |
| [4] | Delsarte, P.; Goethals, J.-M.; Seidel, J. J., Spherical codes and designs, Geom. Dedicata, 6, 363-388 (1977) · Zbl 0376.05015 |
| [5] | Levenshtein, V. I., Universal bounds for codes and designs, (Pless, V. S.; Huffman, W. C., Handbook of Coding Theory (1998), Elsevier: Elsevier Amsterdam), 499-648, Ch. 6 · Zbl 0983.94056 |
| [6] | Musin, O., The kissing number in four dimensions, Ann. of Math., 168, 1-32 (2008) · Zbl 1169.52008 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
