New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
发表时间:2018-11-13 点击次数:
所属单位:理学院
发表刊物:IEEE TRANSACTIONS ON INFORMATION THEORY
关键字:Code division multiple access codebooks signal sets compressed sensing Welch bound Levenshtein bound
摘要:In practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing, and codebooks with small inner-product correlation are required. It is extremely difficult to construct codebooks achieving the Levenshtein bound. In this paper, two new constructions of infinitely many codebooks with multiplicative characters of finite fields are presented. These constructions produce complex codebooks asymptotically achieving the Levenshtein bound and codebooks asymptotically achieving the Welch bound. The codebooks presented in this paper have new parameters.
ISSN号:0018-9448
是否译文:否
发表时间:2017-10-01
合写作者:Heng, Ziling,Ding, Cunsheng
通讯作者:Ding, Cunsheng,岳勤
发表时间:2017-10-01