Abstract
Analytical solution of mutual information by square-root measurement for binary linear code is given. Applying the solution, we show properties of superadditivity in capacity by BCH codes with codeword length 15 and 31. Furthermore, we refer to codes almost achieving the quantum channel capacity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. S. Kholevo, Problemy Peredachi Informatsii, 15, 3, 1979.
M. Sasaki et al., Phys. Rev. A 58, 146, 1998.
T. S. Usuda and I. Takumi, in Quantum Communication, Computing and Measurement 2, P. Kumar, et. al. (Eds.), pp.37–42 (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Usami, S., Usuda, T.S., Takumi, I., Nakano, R., Hata, M. (2002). Superadditivity in Capacity of Quantum Channel by Classical Pseudo-Cyclic Codes. In: Tombesi, P., Hirota, O. (eds) Quantum Communication, Computing, and Measurement 3. Springer, Boston, MA. https://doi.org/10.1007/0-306-47114-0_7
Download citation
DOI: https://doi.org/10.1007/0-306-47114-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-46609-0
Online ISBN: 978-0-306-47114-8
eBook Packages: Springer Book Archive