Large Equiangular Sets of Lines in Euclidean Space
暂无分享,去创建一个
A construction is given of ${{2}\over {9}} (d+1)^2$ equiangular lines in Euclidean $d$-space, when $d = 3 \cdot 2^{2t-1}-1$ with $t$ any positive integer. This compares with the well known "absolute" upper bound of ${{1}\over {2}} d(d+1)$ lines in any equiangular set; it is the first known constructive lower bound of order $d^2$ .
[1] Edwin R. van Dam,et al. Association Schemes Related to Kasami Codes and Kerdock Sets , 1999, Des. Codes Cryptogr..
[2] D. D. Caen,et al. A Family of Antipodal Distance-Regular Graphs Related to the Classical Preparata Codes , 1995 .
[3] J. J. Seidel,et al. Discrete Non-Euclidean Geometry , 1995 .