Optimal and Asymptotically Optimal Codebooks as Regards the Levenshtein Bounds

摘要

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.