Answers are grounded in this paper and cite their sources.
In practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing, and codebooks with small inner-product correlation are required. It is extremely difficult to construct codebooks achieving the Levenshtein bound. In this paper, two new constructions of infinitely many codebooks with multiplicative characters of finite fields are presented. These constructions produce complex codebooks asymptotically achieving the Levenshtein bound and codebooks asymptotically achieving the Welch bound. The codebooks presented in this paper have new parameters.
No takes yet. Share an insight, caveat, or question.
Heng et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: