Quantum error detection .II. Bounds
- 1 May 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (3) , 789-800
- https://doi.org/10.1109/18.841163
Abstract
No abstract availableAll Related Versions
This publication has 11 references indexed in Scilit:
- Upper bounds on the size of quantum codesIEEE Transactions on Information Theory, 1999
- Binomial moments of the distance distribution: bounds and applicationsIEEE Transactions on Information Theory, 1999
- New upper bounds on error exponentsIEEE Transactions on Information Theory, 1999
- Nonbinary quantum codesIEEE Transactions on Information Theory, 1999
- Quantum Analog of the MacWilliams Identities for Classical Coding TheoryPhysical Review Letters, 1997
- 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
- A new upper bound on nonbinary block codesDiscrete Mathematics, 1990
- Self-dual codes over GF(4)Journal of Combinatorial Theory, Series A, 1978
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977