摘要 : A spherical code is a finite set X of points lying on the unit sphere of R/sup n/. For such a set, we define /spl rho/(X) as the minimum of the squared distances /spl par/x-y/spl par//sup 2/, when x, y/spl isin/X and x/spl ne/y. D... 展开
作者 | Lachaud~ G. Stern~ J. |
---|---|
期刊名称 | 《IEEE Transactions on Information Theory》 |
页码/总页数 | P.1140-1146 / 7 |
语种/中图分类号 | 英语 / TN |
关键词 | Polynomials Upper bound |
DOI | 10.1109/18.335961 |
馆藏号 | IELEP0138 |