Convolutional and Tail-Biting Quantum Error-Correcting Codes
Authors:
- Markus GrasslMGMarkus Grassl
- Saikat GuhaSGSaikat Guha
- 20 February 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (3) , 865-880
Abstract
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 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-bitingKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Sparse-Graph Codes for Quantum Error CorrectionIEEE Transactions on Information Theory, 2004
- Cyclic quantum error–correcting codes and quantum shift registersProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2000
- Good quantum-convolutional error-correction codes and their decoding algorithm existPhysical Review A, 1999
- Minimal tail-biting trellises: the Golay code and moreIEEE Transactions on Information Theory, 1999
- Quantum convolutional error-correcting codesPhysical Review A, 1998
- Quantum error correction via codes over GF(4)IEEE Transactions on Information Theory, 1998
- Theory of fault-tolerant quantum computationPhysical Review A, 1998
- A bound for divisible codesIEEE Transactions on Information Theory, 1992
- Structural analysis of convolutional codes via dual codesIEEE Transactions on Information Theory, 1973
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970