On designs in compact metric spaces and a universal bound on their size

Discrete Mathematics

Volumn 192, Issue 1-3, 1998, Pages 251-271

  Levenshtein, Vladimir ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043139158     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00074-0     Document Type: Article

References (41)

1. N. Alon, O. Goldreich, J. Hastad, R. Peralta, Simple construction of almost k-wise independent random variables, Random Struct. Algorithms 3 (3) (1992) 289-304.
2. E. Bannai, T. Ito, Algebraic Combinatorics. I. Association Schemes, Benjamin/Cummings, London, 1984.
3. E. Bannai, S.G. Hoggar, On tight t-designs in compact symmetric spaces of rank one, Proc. Japan Acad. Ser. A 61 (1985) 78-82.
4. E. Bannai, Orthogonal polynomials in coding theory and algebraic combinatorics, in: P. Nevai (Ed.), Orthogonal Polynomials, Kluwer Acad. Publ., Dordrecht, 1990, pp. 25-53.
5. H. Batemann, A. Erdelyi, Higher transcendental functions, vol. 2, McGraw-Hill, New York, 1953.
6. Th. Beth, D. Jungnickel, H. Lenz, Design Theory, Bibl. Institut-Wissenschaftsverlag, Manheim, 1985.
7. R.C. Bose, Mathematical theory of the symmetrical factorial design, Sankhya 8 (1947) 107-166.
8. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-regular graphs, Springer, Berlin, 1989.
9. R. Calderbank, P. Delsarte, Extending the t-design concept, Trans. Amer. Math. Soc. 338 (1993) 941-952.
10. J.H. Conway N.J.A. Sloane, Sphere Packing, Lattices and Groups, 2nd ed., Springer, New York, 1993.
11. Ph. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. (Suppl.) 10 (1973).
12. Ph. Delsarte, J.M. Goethals, J.J. Seidel, Bounds for systems of lines, and Jacobi polynomials, Philips Res. Rep. 30 (1975) 91*-105*.
13. Ph. Delsarte, J.M. Goethals, J.J. Seidel, Spherical codes and designs, Geometriae Dedicata 6 (1977) 363-388.
14. Ph. Delsarte, J.J. Seidel, Fisher-type inequalities for Euclidean t-designs, Linear Algebra Appl. 114/115 (1989) 213-230.
15. C.F. Dunkl, Discrete quadrature and bounds on t-design, Michigan Math. J. 26 (1979) 81-102.
16. R. Gangolli, Positive definite kernels on homogeneous spaces and certain stochastic processes related to Levy's Brownian motion of several parameters, Ann. Inst. Henri Poincare 3 (1967) 121-226.
17. E.N. Gilbert, F.J. MacWilliams, N.J.A. Sloane, Codes which detect deception, Bell System Technol. J. 53 (1974) 405-424.
18. C.D. Godsil, Polynomial spaces, Discrete Math. 73 (1988-89) 71-88.
19. J.M. Goethals, J.J. Seidel, Cubature formulae, polytopes, and spherical designs, in: C. Davis, B. Grunbaum, F.A. Sherk (Eds.), The Geometric Vein, The Coxeter Festschrift, Springer, Berlin, 1982, pp. 203-218.
20. S.G. Hoggar, Bounds for quaternionic line systems and reflection groups, Math. Scandinavia 43 (1978) 241-249.
21. S.G. Hoggar, T-designs in projective spaces, European J. Combin. 3 (1982) 233-254.
22. G.A. Kabatianskii, V.I. Levenshtein, Bounds for packings on a sphere and in space, Problems Inform. Trans. 14 (1) (1978) 1-17.
23. T. Koornwinder, The addition formula for Jacobi polynomials and spherical harmonics, SIAM J. Appl. Math. 25 (1973) 236-246.
24. V.I. Levenshtein, Designs as maximum codes in polynomial metric spaces, Acta Appl. Math. 29 (1992) 1-82.
25. V.I. Levenshtein, Universal bounds for codes and designs, in: V. Pless, C.W. Huffman (Eds.), Handbook of Coding Theory, Elsevier, Amsterdam, 1998.
26. A. Neumaier, Combinatorial configurations in terms of distances, Memorandum 81-09 (Wiskunde), Eindhoven Univ. Technol., 1981.
27. A. Neumaier, J.J. Seidel, Discrete measures for spherical designs, eutactic stars, and lattices, Indag. Math. 50 (1988) 321-334.
28. A. Neumaier, J.J. Seidel, Measures of strength 2e and optimal designs of degree e, Sankhyã 54 (1992) 299-309.
29. H. Niederreiter, Points sets and sequences with small discrepancy, Monatsh. Math. 104 (1987) 273-337.
30. C.R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. Roy Statist. Soc. 89 (1947) 128-139.
31. D.K. Ray-Chaudhuri, R.M. Wilson, On t-designs, Osaka J. Math. 12 (1975) 737-744.
32. I.J. Schoenberg, Positive definite functions on spheres, Duke Math. J. 9 (1942) 96-107.
33. I. Schoenberg, G. Szegö, An extremum problem for polynomials, Composito Math. 14 (1960) 260-268.
34. J.J. Seidel, Isometric embeddings and geometric designs, Discrete Math. 136 (1994) 281-293.
35. P.D. Seymour, T. Zaslavsky, Averaging sets, Adv. Math. 52 (1984) 213-240.
36. I.M. Sobol, On the distribution of points in a cube and the approximate evaluation of integrals, USSR Comput. Math. Math. Phys. 7 (1967) 86-112.
37. D. Stanton, Some q-Krawtchouk polynomials on Chevalley groups, Amer. J. Math. 102 (1980) 625-662.
38. D. Stanton, t-designs in classical association schemes, Graphs Combin. 2 (1986) 283-286.
39. D. Stanton, An introduction to group representations and orthogonal polynomials, Orthogonal Polynomials, Kluwer Acad. Publ., Dordrecht, 1990, pp. 419-433.
40. D.R. Stinson, Combinatorial designs and cryptography, in: K. Walker (Ed.), Surveys in Combinatorics, Cambridge University Press, Cambridge, 1993, pp. 257-287.
41. V.A. Yudin, Lower bounds for spherical designs, Izvestiya: Math. 61 (3) (1997) 673-683.