Polynomial invariants of quantum codes

IEEE Transactions on Information Theory

Volumn 46, Issue 1, 2000, Pages 54-59

  Rains, Eric M ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; POLYNOMIALS; SET THEORY; TENSORS; THEOREM PROVING;

POLYNOMIAL INVARIANTS; QUADRATIC INVARIANTS; QUANTUM CODES; WEIGHT ENUMERATOR;

CODES (SYMBOLS);

EID: 0033882817     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.817508     Document Type: Article

References (8)

1. R. Brauer, "On algebras which are connected with the semisimple continuous groups," Ann. Math., vol. 38, pp. 857-972, 1937.
2. M. Grassl, M. Rötteler, and T. Beth, "Computing local invariants of qubit systems," Phys. Rev. A, vol. 58, pp. 1833-1839, 1998.
3. E. Knill and R. Laflamme, "A theory of quantum error correcting codes," Phys. Rev. A. vol. 55, pp. 900-911, 1997.
4. E. M. Rains, "Increasing subsequences and the classical groups," Elect. J. Combin., vol. 5, no. 1, 1998.
5. _, "Nonbinary quantum codes," IEEE Trans. Inform. Theory, to be published.
6. _, "Quantum codes of minimum distance two," IEEE Trans. Inform. Theory, vol. 45, pp. 266-271, Jan. 1999.
7. _, "Quantum weight enumerators," IEEE Trans. Inform. Theory, vol. 44, pp. 1388-1394, July 1998.
8. 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.