The Covering Radius of Spherical Designs
暂无分享,去创建一个
[1] J. Seidel,et al. Spherical codes and designs , 1977 .
[2] Patrick Solé,et al. Asymptotic bounds on the covering radius of binary codes , 1990, IEEE Trans. Inf. Theory.
[3] S. G. Hoggar. t -designs in Delsarte spaces , 1990 .
[4] A. A. Tietavainen. An upper bound on the covering radius as a function of the dual distance , 1990 .
[5] L. Tóth,et al. New Results in the Theory of Packing and Covering , 1983 .
[6] Eiichi Bannai,et al. On the Weight Distribution of Spherical t-designs , 1980, Eur. J. Comb..
[7] Kishan G. Mehrotra,et al. Generalization of the Norse bounds to codes of higher strength , 1991, IEEE Trans. Inf. Theory.
[8] C. A. Rogers. Covering a sphere with spheres , 1963 .
[9] Jean-Pierre Adoul,et al. Nearest neighbor algorithm for spherical codes from the Leech lattice , 1988, IEEE Trans. Inf. Theory.
[10] Tor Helleseth,et al. On the covering radius of binary codes (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[11] J. J. Seidel,et al. Cubature Formulae, Polytopes, and Spherical Designs , 1981 .
[12] Gérard D. Cohen,et al. Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.
[13] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[14] A. Wyner. Random packings and coverings of the unit n-sphere , 1967 .