Coherence Optimization and Best Complex Antipodal Spherical Codes

Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian line packing problem. Best Complex Antipodal Spherical Codes (BCASCs) are the best vector sets with respect to the coherence. By extending methods used to find best spherical codes in the real-valued Euclidean space, the proposed approach aims to find BCASCs, and thereby, a complex-valued vector set with minimal coherence. There are many applications demanding vector sets with low coherence. Examples are not limited to several techniques in wireless communication or to the field of compressed sensing. Within this contribution, existing analytical and numerical approaches for coherence optimization of complex-valued vector spaces are summarized and compared to the proposed approach. The numerically obtained coherence values improve previously reported results. The drawback of increased computational effort is addressed and a faster approximation is proposed which may be an alternative for time critical cases

A construction of strongly regular Cayley graphs and their applications to codebooks

In this paper, we give a kind of strongly regular Cayley graphs and a class of codebooks. Both constructions are based on choosing subsets of finite fields, and the main tools that we employed are Gauss sums. In particular, these obtained codebooks are asymptotically optimal with respect to the Welch bound and they have new parameters