DocumentCode
2481306
Title
Upper bounds on the size of quantum codes
Author
Ashikhmin, Alexei ; Litsyn, Simon
Author_Institution
Los Alamos Nat. Lab., NM, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
351
Abstract
Upper bounds on the size of quantum error correcting codes are considered. We generalize the linear programming approach to the quantum case and obtain the Singleton, Hamming and first linear programming type bounds for quantum codes
Keywords
error correction codes; linear programming; quantum cryptography; Hamming type bounds; Singleton type bounds; code size; linear programming; quantum error correcting codes; upper bounds; Error correction codes; Laboratories; Linear programming; Polynomials; Quantum mechanics; Rain; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708956
Filename
708956
Link To Document