New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters

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, tw...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 2017-10, Vol.63 (10), p.6179-6187
Hauptverfasser:	Heng, Ziling, Ding, Cunsheng, Yue, Qin
Format:	Artikel
Sprache:	eng
Schlagworte:	Additives Asymptotic properties Code Division Multiple Access codebooks Compressed sensing Correlation Error probability Fields (mathematics) Jacobian matrices Levenshtein bound Multiaccess communication signal sets Space-time codes Time compression Welch bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!