TY - JOUR
T1 - Convolutional and tail-biting quantum error-correcting codes
AU - Forney, G. David
AU - Grassl, Markus
AU - Guha, Saikat
N1 - Funding Information:
Manuscript received November 2, 2005; revised November 7, 2006. The work of S. Guha was supported in part by the U.S. Army Research Office DoD MURI under Grant DAAD-19-00-1-0177. G. D. Forney, Jr. is with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139 USA (e-mail: [email protected]). M. Grassl is with the Institut für Algorithmen und Kognitive Systeme, Univer-sität Karlsruhe (TH), 76128 Karlsruhe, Germany (e-mail: [email protected]). S. Guha is with the Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA 02139 USA (e-mail: [email protected]). Communicated by A. Winter, Associate Editor for Quantum Information Theory. Digital Object Identifier 10.1109/TIT.2006.890698
PY - 2007/3
Y1 - 2007/3
N2 - Rate-(n -2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to are constructed as stabilizer codes from classical self-orthogonal rate-1-/n F4 linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n - 2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding complexity are derived from these convolutional codes via tail-biting.
AB - Rate-(n -2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to are constructed as stabilizer codes from classical self-orthogonal rate-1-/n F4 linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n - 2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding complexity are derived from these convolutional codes via tail-biting.
KW - CSS-type codes
KW - Quantum convolutional codes (QCCs)
KW - Quantum error-correcting codes
KW - Quantum tail-biting codes
UR - http://www.scopus.com/inward/record.url?scp=33947661427&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33947661427&partnerID=8YFLogxK
U2 - 10.1109/TIT.2006.890698
DO - 10.1109/TIT.2006.890698
M3 - Article
AN - SCOPUS:33947661427
SN - 0018-9448
VL - 53
SP - 865
EP - 880
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 3
ER -