论文信息 - On maximal Spherical codes II - 字舞流文

On maximal Spherical codes II

Danyo Danev | Peter Boyvalenkov | Ivan N. Landgev | I. Landgev | P. Boyvalenkov | D. Danev

[1] V. Levenshtein. Designs as maximum codes in polynomial metric spaces , 1992 .

[2] A. Gewirtz,et al. Graphs with Maximal Even Girth , 1969, Canadian Journal of Mathematics.

[3] W. H. Clatworthy. Partially balanced incomplete block designs with two associate classes and two treatments per block , 1955 .

[4] Ivan N. Landjev,et al. On Maximal Spherical Codes I , 1995, AAECC.

[5] Peter Boyvalenkov. Computing distance distributions of spherical designs , 1995 .

[6] Peter J. Cameron,et al. Strongly Regular Graphs Having Strongly Regular Subconstituents , 1978 .

[7] R. M. Damerell,et al. Tight Spherical Disigns, II , 1980 .

[8] Eiichi Bannai,et al. Tight spherical designs, I , 1979 .

[9] J. Seidel,et al. Spherical codes and designs , 1977 .

[10] M. S. Smith,et al. On rank 3 permutation groups , 1975 .

[11] J. Seidel. Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 , 1968 .

[12] NEW UPPER BOUNDS FOR SOME SPHERICAL CODES , 1995 .

[13] Danyo Danev,et al. Upper bounds on the minimum distance of spherical codes , 1996, IEEE Trans. Inf. Theory.

[14] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .