Abstract
A finite set in a complex sphere is called a complex spherical -code if the number of inner products between two distinct vectors in is equal to . In this paper, we characterize the tight complex spherical -codes by doubly regular tournaments, or skew Hadamard matrices. We also give certain maximal 2-codes relating to skew-symmetric -optimal designs. To prove them, we show the smallest embedding dimension of a tournament into a complex sphere by the multiplicity of the smallest or second-smallest eigenvalue of the Seidel matrix.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.