Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
Keyword(s):
<p style='text-indent:20px;'>Codebooks with small maximum cross-correlation amplitudes are used to distinguish the signals from different users in code division multiple access communication systems. In this paper, several classes of codebooks are introduced, whose maximum cross-correlation amplitudes asymptotically achieve the corresponding Welch bound and Levenshtein bound. Specially, a class of optimal codebooks with respect to the Levenshtein bound is obtained. These classes of codebooks are constructed by selecting certain rows deterministically from circulant matrices, Fourier matrices and Hadamard matrices, respectively. The construction methods and parameters of some codebooks provided in this paper are new.</p>
2015 ◽
Vol 713-715
◽
pp. 2012-2015
2006 ◽
Vol 24
(3)
◽
pp. 289-298
◽
2020 ◽
Vol 31
(07)
◽
pp. 875-889
1998 ◽
Vol 46
(3)
◽
pp. 392-399
◽
2018 ◽
Vol 56
(1)
◽
pp. 102
◽
2013 ◽
Vol 8
(2)
◽
pp. 101-109
◽