Abstract
We investigate the possibilities for attaining two Levenshtein upper bounds for spherical codes. We find the distance distributions of all codes meeting these bounds. Then we show that the fourth Levenshtein bound can be attained in some very special cases only. We prove that no codes with an irrational maximal scalar product meet the third Levenshtein bound. So in dimensions 3 ≤ n ≤ 100 exactly seven codes are known to attain this bound and ten cases remain undecided. Moreover, the first two codes (in dimensions 5 and 6) are unique up to isometry. Nonexistence of maximal codes in all dimensions n with cardinalities between 2n+1 and 2n+[7√n] is shown as well. We prove nonexistence of several infinite families of maximal codes whose maximal scalar product is rational. The distance distributions of the only known nontrivial infinite family of maximal codes (due to Levenshtein) are given.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P.Delsarte, J.M.Goethals, J.J.Seidel, Spherical codes and designs, Geom. Dedicata 6, 1977, 363–388.
J.H.Conway, N.J.A.Sloane, Sphere Packings, Lattices and Groups, Springer — Verlag, New York 1988.
P.G.Boyvalenkov, Computing distance distribution of spherical designs, to appear in Linear Algebra and Its Applications.
P.G.Boyvalenkov, P.Kazakov, Nonexistence of Certain Spherical Codes, to appear in C.R. Acad. Bulg. Sci..
P.G.Boyvalenkov, All derived of the tight spherical 5-design on S 6 are unique, submitted.
P.W.H.Lemmens, J.J.Seidel, Equiangular lines, Journal of Algebra 24, 1973, 494–512.
V.I.Levenshtein, On bounds for packings in n-dimensional Euclidean space, Soviet Math. Doklady 20, 1979, 417–421.
V.I.Levenshtein, Bounds for packings in metric spaces and certain applications, Probl. Kibernetiki 40, 1983, 44–110 (in Russian).
V.I.Levenshtein, Packing of polynomial metric spaces, Proc. Third Intern. Workshop on Inform. Theory, Sochi 1987, 116–119 (in Russian).
V.I.Levenshtein, Designs as maximum codes in polynomial metric spaces, Acta Applicandae Math. 25, 1–83, 1992.
R.A.Rankin, The closest packing of spherical caps in n dimensions, Proc. Glasgow Math. Assoc. 2, 1955, 139–144.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyvalenkov, P., Landgev, I. (1995). On maximal spherical codes I. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-60114-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60114-2
Online ISBN: 978-3-540-49440-9
eBook Packages: Springer Book Archive