Upper bounds on the size of quantum codes
- 1 May 1999
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (4) , 1206-1215
- https://doi.org/10.1109/18.761270
Abstract
This paper is concerned with bounds for quantum error-correcting codes, Using the quantum MacWilliams identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.Keywords
This publication has 24 references indexed in Scilit:
- Quantum error correction via codes over GF(4)IEEE Transactions on Information Theory, 1998
- Quantum weight enumeratorsIEEE Transactions on Information Theory, 1998
- On Upper Bounds for Minimum Distance and Covering Radius of Non-binary CodesDesigns, Codes and Cryptography, 1998
- Theory of quantum error-correcting codesPhysical Review A, 1997
- Quantum Error Correction and Orthogonal GeometryPhysical Review Letters, 1997
- Class of quantum error-correcting codes saturating the quantum Hamming boundPhysical Review A, 1996
- On the distance distribution of codesIEEE Transactions on Information Theory, 1995
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spacesIEEE Transactions on Information Theory, 1995
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Good self dual codes existDiscrete Mathematics, 1972