On maximal spherical codes II

Journal of Combinatorial Designs

Volumn 7, Issue 5, 1999, Pages 316-326

  Boyvalenkov, Peter ^a   Danev, Danyo ^a   Landgev, Ivan ^a  

^a INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

Author keywords

Linear programming bound; Spherical codes; Spherical designs; Strongly regular graphs

Indexed keywords

EID: 27844570434     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1999)7:5<316::AID-JCD2>3.0.CO;2-Z     Document Type: Article

References (18)

1. M. Abramowitz and I. A. Stegun, Handbook of mathematical functions, Dover, New York, 1965.
2. E. Bannai and R. M. Damerell, Tight spherical designs I, J. Math. Soc. Japan 31 (1979), 199-207.
3. _ and _, Tight spherical designs II, J. London Math. Soc. 21 (1980), 13-30.
4. P. G. Boyvalenkov, Computing distance distribution of spherical designs, Linear Algebra Appl. 226/228 (1995), 277-286.
5. P. G. Boyvalenkov and I. N. Landgev, On maximal spherical codes I, AAECC XI Symposium, Paris 1995, Lect. Notes Comp. Sci. 948, 158-168.
6. P. G. Boyvalenkov and P. Kazakov, New upper bounds for some spherical codes, Serdica Math. J. 21 (1995), 231-238.
7. P. Boyvalenkov, D. Danev, and S. Dimcheva, Upper bounds on the minimum distance of spherical codes, IEEE Trans. Inform. Theory 42 (1996), 1576-1581.
8. A. E. Brouwer and J. H. van Lint, "Strongly regular graphs and partial geometries," in Enumeration and design, D. M. Jackson and S. A. Vanstone (Editors), Academic, Toronto 1984, pp. 85-122.
9. P. J. Cameron, J.-M. Goethals, and J. J. Seidel, Strongly regular graphs having strongly regular subconstituents, J. Algebra 55 (1978), 257-280.
10. W. H. Clatworthy, Partially balanced incomplete block designs with two associate classes and two treatments per block, J. Res. Nat Bur. Standards 54 (1955), 177-190.
11. P. Delsarte, J.-M. Goethals, and J. J. Seidel, Spherical codes and designs, Geom. Dedicata 6 (1977), 363-388.
12. A. Gewirtz, Graphs with maximal even girth, Canad. J. Math. 21 (1970), 915-934.
13. G. A. Kabatyanskii and V. I. Levenshtein, Bounds for packings on a sphere and in space, Probl. Inform. Transm. 14 (1978), 1-17.
14. V. I. Levenshtein, On bounds for packings in n-dimensional Euclidean space, Soviet Math. Dokl. 20 (1979), 417-421.
15. _, Bounds for packings in metric spaces and certain applications, Probl. Kibernetiki 40 (1983), 44-110 (in Russian).
16. _, Designs as maximum codes in polynomial metric spaces, Acta Appl. Math. 29 (1992), 1-82.
17. J. J. Seidel, Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3, Linear Algebra Appl. 1 (1968), 281-298.
18. M. S. Smith, On rank 3 permutation groups, J. Algebra33 (1975), 22-42.