Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
Gaojun Luo, Xiwang Cao · IEEE Transactions on Information Theory · 2017
Codebooks with low-coherence have wide utilization in many fields, such as direct spread code division multiple access communications, compressed sensing and so on. There are two major ingredients in this paper. The first is to present a new character sum, the hyper Eisenstein sum and study the properties of this character sum. As an application, the second ingredient is to propose two constructions of codebooks with the hyper Eisenstein sum. The codebooks generated by these constructions asymptotically meet the Welch bound. The parameters of these codebooks are new.