Six constructions of asymptotically optimal codebooks via the character sums (Q2182078)

Codebooks with small maximum cross correlation magnitude are desired in communications. In this paper, six construction of nearly optimal codebooks are devied. The first one is known in [``Constructions of codebooks asymptotically achieving the Welch bound with additive characters'', IEEE Signal Process. Lett. 26, No. 4, 622--626 (2019)]. This construction is based on some additive characters and a special set $D_1$. The main contribution of this paper is another five construction of codebooks. The authors use multiplicative and additive characters and special sets $D_2,D_3,D_4,D_5$ over finite fields to modify the first construction. Consequently, they obtain five new classes of asymptotically optimal codebooks with a few maximum cross correlation magnitudes. To this end, the values of some character sums are discussed in this paper.