Two constructions of asymptotically optimal codebooks according to the welch bound

You Gao and Min-Yao Niu

Applied Mathematics and Computation, 2019, vol. 348, issue C, 167-174

Abstract: In a number of applications, the codebook that minimizes the maximal cross-correlation amplitude (Imax) is often desirable. There are two major ingredients in this paper. These two contents are to propose two constructions of codebooks. The codebooks generated by these constructions asymptotically meet the Welch bound. What we find is the codebook constructed in Section 2 can also asymptotically meet the Levenshtein bound. The parameters of these codebooks are new.

Keywords: Codebooks; Asymptotic optimality; Welch bound; Levenshtein bound; Vector space; Projective space (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318310361
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:348:y:2019:i:c:p:167-174

DOI: 10.1016/j.amc.2018.11.062

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().