New Constructions of Codebooks Asymptotically Achieving the Welch Bound

Abstract

In this paper, we propose two constructions of complex codebooks from character sums over Galois rings. The complex codebooks produced by these two constructions are proved to be asymptotically optimal with respect to the Welch bound. In addition, the parameters of the complex codebooks presented in this paper are new.