Two constructions of asymptotically optimal codebooks according to the welch bound

摘要

In a number of applications, the codebook that minimizes the maximal cross-correlation amplitude (I-max) is often desirable. There are two major ingredients in this paper. These two contents are to propose two constructions of codebooks. The codebooks generated by these constructions asymptotically meet the Welch bound. What we find is the codebook constructed in Section 2 can also asymptotically meet the Levenshtein bound. The parameters of these codebooks are new. (C) 2018 Elsevier Inc. All rights reserved.