Optimal and Asymptotically Optimal Codebooks as Regards the Levenshtein Bounds
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E104-A No.7 pp.979-983
- Publication Date
- 2021/07/01
- Publicized
- 2021/01/12
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2020EAL2113
- Type of Manuscript
- LETTER
- Category
- Digital Signal Processing
Authors
Hong-Li WANG
Tangshan Normal University
Li-Li FAN
Tangshan Normal University
Gang WANG
Tianjin Normal University
Lin-Zhi SHEN
Civil Aviation University of China
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hong-Li WANG, Li-Li FAN, Gang WANG, Lin-Zhi SHEN, "Optimal and Asymptotically Optimal Codebooks as Regards the Levenshtein Bounds" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 7, pp. 979-983, July 2021, doi: 10.1587/transfun.2020EAL2113.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2113/_p
Copy
@ARTICLE{e104-a_7_979,
author={Hong-Li WANG, Li-Li FAN, Gang WANG, Lin-Zhi SHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimal and Asymptotically Optimal Codebooks as Regards the Levenshtein Bounds},
year={2021},
volume={E104-A},
number={7},
pages={979-983},
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.},
keywords={},
doi={10.1587/transfun.2020EAL2113},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Optimal and Asymptotically Optimal Codebooks as Regards the Levenshtein Bounds
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 979
EP - 983
AU - Hong-Li WANG
AU - Li-Li FAN
AU - Gang WANG
AU - Lin-Zhi SHEN
PY - 2021
DO - 10.1587/transfun.2020EAL2113
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2021
AB - 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.
ER -
English
