.png){kind=icon}
.png){kind=icon}
Return
Asymptotically Optimal Codebooks Derived From Generalised Bent Functions
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2980330.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to construct optimal codebooks. In this paper, two kinds of codebooks are presented and proved to be optimally optimal with respect to the Welch bound. Additionally, the constructed codebooks in this paper have new parameters.
Keywords:
Correlation
Multiaccess communication
Boolean functions
Cryptography
Licenses
Education
Information theory
Codebook
asymptotic optimality
Welch bound
generalised bent function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W