Optimal and asymptotically optimal codebooks as regards the Levenshtein bounds

Hong-Li WANG; Li-Li FAN; Gang WANG; Lin-Zhi SHEN

doi:10.1587/transfun.2020EAL2113

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

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

Optimal and asymptotically optimal codebooks as regards the Levenshtein bounds

Hong-Li WANG, Li-Li FAN, Gang WANG, Lin-Zhi SHEN

Author information

Keywords: Codebooks, Maximal cross-correlation amplitude, Levenshtein bounds, (Asymptotic) optimality, MUB, AMUB

JOURNAL RESTRICTED ACCESS Advance online publication

Article ID: 2020EAL2113

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

The final version of this article is now available: Vol. E104.A (2021), No. 7 pp. 979-983

Details

Abstract

In the letter, two classes of optimal codebooks and asymptotically optimal codebooks in regard to the Levenshtein bound are presented, which are based on mutually unbiased bases (MUB) and approximately mutually unbiased bases (AMUB), respectively.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!