Referenced Items are not available for this document.
A polynomial-time construction of a sequence of self-orthogonal geometric Goppa codes attaining the Tsfasman-Vladut-Zink (TVZ) bound is presented. The issue of constructing such a code sequence was addressed in a context of constructing quantum error-correcting codes (Ashikhmin et al., 2001). Naturally, the obtained construction has implications on quantum error-correcting codes. In particular, the best known asymptotic lower bounds on the largest minimum distance of polynomially constructible quantum error-correcting codes are improved.
Published in:
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Date of Conference: June 28 2009-July 3 2009
- Page(s):
- 794 - 798
- E-ISBN :
- 978-1-4244-4313-0
- Print ISBN:
- 978-1-4244-4312-3
- INSPEC Accession Number:
- 10841998
- Conference Location :
- Seoul
- Digital Object Identifier :
- 10.1109/ISIT.2009.5205647
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
