Properties of Quantum Gain of Coding with Information Criterion by Binary Linear Codes
-
- Ishida Yuki
- Aichi Prefectural University
-
- Usami Shogo
- Meijo University
-
- Usuda Tsuyoshi Sasaki
- Aichi Prefectural University
-
- Takumi Ichi
- Nagoya Institute of Technology
Bibliographic Information
- Other Title
-
- 2元線形符号による情報量規準に基づく符号化の量子利得特性
- 2ゲン センケイ フゴウ ニ ヨル ジョウホウリョウ キジュン ニ モトヅク フゴウカ ノ リョウシ リトク トクセイ
Search this article
Abstract
In quantum information theory, there is superadditivity in capacity of a quantum channel as special property. We showed the calculating method of mutual information analytically for binary linear codes by using Square-root measurement as decoding process. Therefore, many examples of codes which shows existence of superadditivity in capacity have been given. But the scope of method was not clarified. In the present paper, we show the method can be applied to any binary linear codes. Moreover, we show quantum channel capacity is almost attained in finite codeword length by using approximation to simplex code.
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 126 (12), 1474-1482, 2006
The Institute of Electrical Engineers of Japan
- Tweet
Keywords
Details
-
- CRID
- 1390282679582858368
-
- NII Article ID
- 10018402949
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 8593332
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed