Four Constructions of Asymptotically Optimal Codebooks via Additive Characters and Multiplicative Characters

Xia Wu and Wei Lu
Additional contact information
Xia Wu: School of Mathematics, Southeast University, Nanjing 210096, China
Wei Lu: School of Mathematics, Southeast University, Nanjing 210096, China

Mathematics, 2019, vol. 7, issue 12, 1-13

Abstract: In this paper, we present four new constructions of complex codebooks with multiplicative characters, additive characters, and quadratic irreducible polynomials and determine the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the Welch bound. Moreover, we generalize the result obtained by Zhang and Feng and contain theirs as a special case. The parameters of these codebooks are new.

Keywords: codebook; asymptotic optimality; Welch bound; Gauss sum; Jacobi sum (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/12/1144/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/12/1144/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:12:p:1144-:d:290157

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().