Enlargement of Calderbank-Shor-Steane quantum codes
Author:
- A.M. SteaneASA.M. Steane
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7) , 2492-2495
Abstract
It is shown that a classical error correcting code C = [n, k, d] which contains its dual, C⊥ ⊆ C, and which can be enlarged to C′ = [n, k′ > k + 1, d′], can be converted into a quantum code of parameters [[n, k+k′ -n, min (d, [3d′/2])]]. This is a generalization of a previous construction, it enables many new codes of good efficiency to be discovered. Examples based on classical Bose-Chaudhuri-Hocquenghem (BCH) codes are discussed. © 1999 IEEEKeywords
This publication has 20 references indexed in Scilit:
- Quantum codes of minimum distance twoIEEE Transactions on Information Theory, 1999
- A Nonadditive Quantum CodePhysical Review Letters, 1997
- Codes for the quantum erasure channelPhysical Review A, 1997
- Theory of quantum error-correcting codesPhysical Review A, 1997
- Quantum Error Correction and Orthogonal GeometryPhysical Review Letters, 1997
- Mixed-state entanglement and quantum error correctionPhysical Review A, 1996
- Perfect Quantum Error Correcting CodePhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- On a class of error correcting binary group codesInformation and Control, 1960