Fetching the paper…
Reading the bibliography…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces).
P. Chebyshev, Sur l’interpolation des valeurs équidistantes, in Markoff, A.; Sonin, N.,
1907
Earlier work this paper cites.
M. Krawtchouk, Sur une généralisation des polynômes d’Hermite,
1929
Earlier work this paper cites.
G. Szegő,
1939
Earlier work this paper cites.
C. R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays,
1947
Earlier work this paper cites.
W. Hahn, Über Orthogonalpolynome, die q-Differenzengleichungen genügen,
1949
Earlier work this paper cites.
H.-C. Wang, Two-point homogeneous spaces,
1952
Earlier work this paper cites.
M. Abramowitz, I. A. Stegun,
1965
Earlier work this paper cites.
N. J. Vilenkin,
1968
Earlier work this paper cites.
P. Delsarte, Bounds for unrestricted codes by linear programming,
1972
Earlier work this paper cites.
P. Delsarte,
1973
Earlier work this paper cites.
P. Delsarte, Four fundamental parameters of a code and their combinatorial significance,
1973
Earlier work this paper cites.
P. Delsarte, J.-M. Goethals, J. J. Seidel, Bounds for systems of lines, and Jacobi polynomials,
1975
Earlier work this paper cites.
D. K. Ray-Chaudhuri, R. M. Wilson, On
1975
Earlier work this paper cites.
P. Delsarte, J.-M. Goethals, J. J. Seidel, Spherical codes and designs,
1977
Earlier work this paper cites.
F. J. MacWilliams, N. J. A. Sloane,
1977
Earlier work this paper cites.
R. J. McEliece, E. R. Rodemich, H. C. Rumsey, L. R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities,
1977
Earlier work this paper cites.
P. J. Cameron, J.-M. Goethals, J. J. Seidel, The Krein condition, spherical designs, Norton algebras and permutation groups,
1978
Earlier work this paper cites.
S. Helgason,
1978
Earlier work this paper cites.
G. A. Kabatianskii, V. I. Levenshtein, Bounds for packings on a sphere and in space,
1978
Cited alongside, same era.
C. F. Dunkl, Discrete quadrature and bounds on
1979
Cited alongside, same era.
V. I. Levenshtein, On bounds for packings in
1979
Cited alongside, same era.
V. M. Sidel’nikov, On extremal polynomials used to estimate the size of codes,
1980
Cited alongside, same era.
A. Neumaier, Combinatorial configurations in terms of distances, Memorandum 81-09 (Dept. Math.), Eindhoven Univ. Technology, 1981
1981
Cited alongside, same era.
S. G. Hoggar,
1982
Cited alongside, same era.
V. A. Yudin, Minimum potential energy of a point system of charges,
1993
Later among the works it cites.
V. I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces,
1995
Later among the works it cites.
P. Boyvalenkov, D. Danev, S. Bumova, Upper bounds on the minimum distance of spherical codes,
1996
Later among the works it cites.
P. Boyvalenkov, D. Danev, On maximal codes in polynomial metric spaces, in Proc. AAECC-12,
1997
Later among the works it cites.
P. Boyvalenkov, D. Danev, On linear programming bounds for codes in polynomial metric spaces,
1998
Later among the works it cites.
P. Delsarte, V. I. Levenshtein, Association schemes and coding theory,
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1982
Cited alongside, same era.
N. J. A. Sloane, Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods,
1982
Cited alongside, same era.
V. I. Levenshtein, Bounds for packings in metric spaces and certain applications,
1983
Cited alongside, same era.
E. Bannai, T. Ito,
1984
Cited alongside, same era.
D. A. Leonard, Parameters of association schemes that are both P- and Q-polynomial,
1984
Cited alongside, same era.
P. Terwilliger, A characterization of P- and Q-polynomial schemes,
1987
Cited alongside, same era.
1998
Later among the works it cites.
V. I. Levenshtein, Universal bounds for codes and designs,
1998
Later among the works it cites.
V. S. Pless and W. C. Huffman, Eds.,
1998
Later among the works it cites.
A. Hedayat, N. J. A. Sloane, J. Stufken,
1999
Later among the works it cites.
S. Boumova, D. Danev, On the asymptotic behaviour of a necessary condition for existence of spherical designs, Proc. Intern. Workshop ACCT, Sept. 8-14, (2002) 54-57
2002
Later among the works it cites.
H. Cohn, A. Kumar, Universally optimal distribution of points on spheres,
2006
Later among the works it cites.
H. Cohn, J. Woo, Three-point bounds for energy minimization,
2012
Later among the works it cites.
P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, M. Stoyanova, Universal upper and lower bounds on energy of spherical designs,
2015
Later among the works it cites.
P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, M. Stoyanova, Universal lower bounds for potential energy of spherical codes,
2016
Later among the works it cites.
Ei. Bannai, Et. Bannai, H. Tanaka, Y. Zhu, Design theory from the viewpoint of Algebraic Combinatorics,
2017
Later among the works it cites.
P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, M. Stoyanova, Energy bounds for codes and designs in Hamming spaces,
2017
Later among the works it cites.
S. Borodachov, D. Hardin, E. Saff,
2018
Closest in time.