Asymptotically Optimal Codebooks in Regard to the Welch Bound With Characters

Gang WANG; Min-Yao NIU; Lin-Zhi SHEN; You GAO

doi:10.1587/transfun.2020EAL2003

This article has now been updated. Please use the final version.

Asymptotically Optimal Codebooks in Regard to the Welch Bound With Characters

Gang WANG, Min-Yao NIU, Lin-Zhi SHEN, You GAO

Author information

Keywords: Codebooks, Maximal cross-correlation amplitude, Welch bound, Asymptotic optimality, Additive Character, Multiplicative character

JOURNAL RESTRICTED ACCESS Advance online publication

Article ID: 2020EAL2003

DOI https://doi.org/10.1587/transfun.2020EAL2003

The final version of this article is now available: Vol. E103.A (2020), No. 11 pp. 1292-1295

Details

Abstract

In this letter, motivated by the research of Tian et al., two constructions of asymptotically optimal codebooks in regard to the Welch bound with additive and multiplicative characters are provided. The parameters of constructed codebooks are new, which are different from those in the letter of Tian et al.

Corresponding author

Register with J-STAGE for free!