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

Abstract

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.

Keywords

• codebooks
• strongly regular cayley graphs
• finite fields
• gauss sums
• welch bound