Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448)
From MaRDI portal
scientific article; zbMATH DE number 7736623
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound |
scientific article; zbMATH DE number 7736623 |
Statements
Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (English)
0 references
12 September 2023
0 references
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.
0 references
code constructions
0 references
circulant matrices
0 references
Fourier matrices
0 references
Hadamard matrices
0 references
optimal codes
0 references
cross correlation
0 references
Welch bound
0 references
Levenshtein bound
0 references
0 references
0 references