Complex spherical codes with two inner products
Combinatorics
2015-07-23 v2
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.
Cite
@article{arxiv.1503.01575,
title = {Complex spherical codes with two inner products},
author = {Hiroshi Nozaki and Sho Suda},
journal= {arXiv preprint arXiv:1503.01575},
year = {2015}
}
Comments
10 pages, to appear in European Journal of Combinatorics