Premium
Properties of quantum gain of coding with information criterion by binary linear codes
Author(s) -
Ishida Yuki,
Usami Shogo,
Usuda Tsuyoshi Sasaki,
Takumi Ichi
Publication year - 2008
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/eej.20646
Subject(s) - superadditivity , low density parity check code , quantum channel , code word , mathematics , classical capacity , discrete mathematics , algorithm , linear code , quantum information , channel capacity , binary number , decoding methods , quantum , theoretical computer science , computer science , coding (social sciences) , physics , block code , quantum mechanics , arithmetic , statistics , mathematical analysis
In quantum information theory, superadditivity in the capacity of a quantum channel occurs as a special property. We present a method of calculating the mutual information analytically for binary linear codes by using square‐root measurement as the decoding process. Many examples of codes showing the existence of superadditivity in capacity have been given in the past, but the scope of the method was not clarified. In the present paper, we show that the method can be applied to any binary linear codes. We also show that the quantum channel capacity is almost fully attained in a finite codeword length by using approximation to simplex code. © 2008 Wiley Periodicals, Inc. Electr Eng Jpn, 163(4): 48–57, 2008; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20646