Necessary conditions for existence of some designs in polynomial metric spaces

European Journal of Combinatorics

Volumn 20, Issue 3, 1999, Pages 213-225

  Boyvalenkov, Peter ^a   Boumova, Silvia ^a   Danev, Danyo ^b  

^a INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

^b LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033422348     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1998.0278     Document Type: Article

References (33)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover, New York, 1965.
2. B. Bajnok, Constructions of spherical 3-designs, Graphs Combin., 14 (1998), 97-107.
3. E. Bannai and R. M. Damerell, Tight spherical designs I, J. Math. Soc. Japan, 31 (1979), 199-207.
4. E. Bannai and R. M. Damerell, Tight spherical designs II, J. London Math. Soc., 21 (1980), 13-30.
5. E. Bannai and S. G. Hoggar, On tight t-designs in compact symmetric spaces of rank one, Proc. Japan Acad., 61A (1985), 78-82.
6. E. Bannai and S. G. Hoggar, Tight t-designs and square-free integers, Europ. J. Combinatorics, 10 (1989), 113-135.
7. E. Bannai and T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin, Menlo Park, CA, 1984.
8. P. G. Boyvalenkov, Computing distance distribution of spherical designs, Linear Algebr. Appl., 226/228 (1995), 277-286.
9. P. G. Boyvalenkov, S. P. Bumova and D. K. Donev, On the structure of spherical (2k)-designs, in Proc. Intern. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria 1998, 33-38.
10. P. G. Boyvalenkov and D. P. Danev, On maximal codes in polynomial metric spaces, Proceedings of AAECC-12, Toulouse, June 1997, in: Lecture Notes in Computer Science 1255 (1997), 29-38.
11. P. G. Boyvalenkov and D. P. Danev, Lower bounds on the minimum possible odd cardinality of spherical (2e + 1)-designs, Preprint.
12. P. G. Boyvalenkov, D. P. Danev and S. Nikova, Nonexistence of certain spherical designs of odd strengths and cardinalities, Discr. Comp. Geom., 21 (1999), 143-156
13. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer-Verlag, New York, 1988.
14. P. Delsarte, An Algebraic Approach to the Association Schemes in Coding Theory, Philips Res. Rep., 10 (1973).
15. P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Inf. Control., 23 (1973), 407-438.
16. P. Delsarte, J.-M. Goethals and J.J. Seidel, Spherical codes and designs, Geom. Dedicata, 6 (1977), 363-388.
17. C. F. Dunkl, Discrete quadrature and bounds on t-designs, Mich. Math. J., 26 (1979), 81-102.
18. G. Fazekas and V. I. Levenshtein, On the upper bounds for code distance and covering radius of designs in polynomial metric spaces, J. Comb. Theory Ser. A, 70 (1995), 267-288.
19. C. D. Godsil, Algebraic Combinatorics, Chapman and Hall, London, 1993.
20. R. H. Hardin and N. J. A. Sloane, McLaren's improved snub cube and other new spherical designs in three dimensions, Discrete Comput. Geom., 15 (1996), 429-441.
21. S. Helgason, Differential Geometry, Lie Groups and Symmetric Spaces, Academic Press, New York, 1978.
22. S. G. Hoggar, t-designs in projective spaces, Europ. J. Combinatorics, 3 (1982), 233-254.
23. G. A. Kabatianskii and V. I. Levenshtein, Bounds for packings on a sphere and in space, Probl. Inform. Transm., 14 (1978), 1-17.
24. V. I. Levenshtein, On choosing polynomials to obtain bounds in packing problems, in: Proc. Seventh All-Union Conf. on Coding Theory and Inform. Transm., Part II, Moscow, Vilnius, 1978, 103-108 (in Russian).
25. V. I. Levenshtein, Bounds for packings in metric spaces and some of their applications, Probl. Kibernetiki, 40 (1983), 44-110 (in Russian).
26. V. I. Levenshtein, Designs as maximum codes in polynomial metric spaces, Acta Appl. Math., 25 (1992), 1-82.
27. V. I. Levenshtein, Universal bounds for codes and designs, in: Handbook of Coding Theory.
28. A. Neumaier, Combinatorial configurations in terms of distances, Memorandum 81-09 (Dept. Math.), Eindhoven University Technology, 1981.
29. R. Noda, On orthogonal arrays of strength 4 achieving Rao's bound, J. London Math. Soc., 19 (1979), 385-390.
30. C. R. Rao, Factorial experiments derivable from combinatorial arrangements, J. R. Stat. Soc., 89 (1947), 128-139.
31. D. K. Ray-Chaudhuri and R. M. Wilson, On t-designs, Osaka J. Math., 12 (1975), 737-744.
32. P. Terwilliger, A characterization of P- and Q-polynomial schemes, J. Comb. Theory Ser. A, 45 (1987), 8-26.
33. H.-C. Wang, Two-point homogeneous spaces, Ann. Math., 55 (1952), 177-191.