Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448): Difference between revisions

In practical applications, performance measure of an \((N, K)\) codebook \(C\) is considered as maximal cross-correlation amplitude, denoted by \(I_{\max}(C)\), defined by \[ I_{\max}(C) = \max_{0\leq i\neq j \leq N-1} |c_ic_j^{H}|. \] In this paper, the authors have constructed codebooks, whose maximum cross-correlation amplitudes asymptotically meet the Welch bound and Levenshtein bound. These classes of codebooks have been constructed by selecting certain rows deterministically from circulant matrices, Fourier matrices and Hadamard matrices.