Hits:

Affiliation of Author(s):理学院

Journal:IEEE TRANSACTIONS ON INFORMATION THEORY

Key Words:Code division multiple access codebooks signal sets compressed sensing Welch bound Levenshtein bound

Abstract: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 No.:0018-9448

Translation or Not:no

Date of Publication:2017-10-01

Co-author:Heng, Ziling,Ding, Cunsheng

Correspondence Author:Ding, Cunsheng,yq