Apr 21, 2020 · By shortening the length of the optimal codebooks, we present a construction of codebooks asymptotically meeting the Levenshtein bound. To ...
A Construction of Codebooks Asymptotically Meeting the ...
www.researchgate.net › publication › 36...
By shortening the length of the optimal codebooks, we present a construction of codebooks asymptotically meeting the Levenshtein bound. To the best of our ...
By shortening the length of the optimal codebooks, we present a construction of codebooks asymptotically meeting the Levenshtein bound. To the best of our ...
A Construction of Codebooks Asymptotically Meeting ... - IEICE Trans
search.ieice.org › bin › summary
Nov 1, 2022 · We prove that the new codebook with length K=q+1 and size N=q2+2q+2 is asymptotically optimal with nearly achieving the Levenshtein bound when n ...
By shortening the length of the optimal codebooks, this paper presents a construction of codebooks asymptotically meeting the Levenshtein bound and proves ...
A Construction of Codebooks Asymptotically Meeting the Levenshtein Bound ... Zhang, “A construction of codebooks nearly achieving the Levenshtein bound ...
In this paper, several classes of codebooks are introduced, whose maximum cross-correlation amplitudes asymptotically achieve the corresponding Welch bound and ...
Following the proposed constructions, two classes of asymptotically optimal codebooks with respect to the Welch bound are obtained and the resulting ...
May 1, 2019 · Constructing codebooks achieving the Levenshtein bounds looks very hard in general. The known codebooks meeting the Levenshtein bound are ...
May 1, 2019 · What we find is the codebook constructed in Section 2 can also asymptotically meet the Levenshtein bound. The parameters of these codebooks are ...