Upper bounds on the size of quantum codes

A. Ashikhmin, S. Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages351
Number of pages1
ISBN (Print)0780350006, 9780780350007
DOIs
StatePublished - 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

Fingerprint

Dive into the research topics of 'Upper bounds on the size of quantum codes'. Together they form a unique fingerprint.

Cite this