A New Construction of Codebooks Meeting the Levenshtein Bound

A New Construction of Codebooks Meeting the Levenshtein Bound

Codebooks with low coherence have extensive applications in many fileds such as code division multiple access (CDMA) communication systems, MIMO communications, compressed sensing and so on. In this paper, based on additive characters over finite fields, we propose a construction of optimal codebook...

Full description

Bibliographic Details
Main Authors: Li Han, Shimin Sun, Yang Yan, Qiuyan Wang
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Codebook
asymptotic optimality
Levenshtein bound
character
finite field
Online Access:https://ieeexplore.ieee.org/document/9075233/

Internet

https://ieeexplore.ieee.org/document/9075233/

Similar Items