Quantum error detection II: bounds

IEEE Transactions on Information Theory

Volumn 46, Issue 3, 2000, Pages 789-800

  Ashikhmin, Alexei E ^a   Barg, Alexander M ^a   Knill, Emanuel ^a   Litsyn, Simon N ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); LINEAR PROGRAMMING; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

QUANTUM CODES; QUATERNARY CODES; WEIGHT ENUMERATORS;

ERROR DETECTION;

EID: 0034188124     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.841163     Document Type: Article

References (15)

1. [ l ] M. Aaltonen, "Linear programming bounds for tree codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 85-90, Jan. 1979.
2. "A new upper bound on nonbinary block codes," Discr. Math., vol. 83, no. 2-3, pp. 139-160, 1990.
3. A. Ashikhmin and A. Barg, "Binomial moments of the distance distribution: Bounds and applications," IEEE Trans. Inform. Theory, vol. 45, pp. 438-452, Mar. 1999.
4. A. Ashikhmin and S. Litsyn, "Upper bounds of the size of quantum codes," IEEE Trans. Inform. Theory,vol.45,pp. 1205-1215, May 1999.
5. P. Delsarte, "Bounds for unrestricted codes, by linear programming," Philips Res. Repts., vol. 27, pp. 272-289, 1972.
6. "An algebraic approach to the association schemes of coding theory," Philips Res. Rep. Suppl., no. 10, 1973.
7. G. Kalai and N. Linial, "On thé distance distribution of codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1467-1472, 1995.
8. E. Knill, "Non-Binary Unitary Error Bases and Quantum Codes," Los Alamos Nat. Lab., Rep. LAUR-96-2717, 1996.
9. V.I. Levenshtein, "Bounds on the probability of undetected error," Probl. Pered. Inform., vol. 13, no. 1, pp. 3-18, 1977.
10. "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, May 1995.
11. S. Litsyn, "New upper bounds on error exponents," IEEE Trans. Inform. Theory, vol. 45, pp. 385-398, Mar. 1999.
12. R.J. McEliece, E. R. Rodemich, H. C. Rumsey Jr., and L. R. Welch, "New upper bounds on the rate of a code via the Delsarte-MacWilliams Inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, 1977.
13. F.J. MacWilliams, A. M. Odlyzko, and N. J. A. Sloane, "Self-dual codes over GF(4)," J. Comb. Theory, ser. A, vol. 25, pp. 288-318, 1978.
14. E. Rains, "Nonbinary quantum codes," IEEE Trans. Inform. Theory, vol. 45, pp. 1827-1832, Nov. 1999.
15. P.W. Shor and R. Laflamme, "Quantum analog of the MacWilliams identities in classical coding theory," Phys. Rev. Lett., vol. 78, pp. 1600-1602, 1997.