arXiv:quant-ph/0006061AbstractReferencesReviewsResources
Asymptotically Good Quantum Codes
A. Ashikhmin, S. Litsyn, M. A. Tsfasman
Published 2000-06-13Version 1
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
Comments: 15 pages, 1 figure
Categories: quant-ph
Keywords: quantum codes, algebraic geometry codes, polynomial construction, asymptotically non-zero rate
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1612.07150 [quant-ph] (Published 2016-12-21)
Good and asymptotically good quantum codes derived from algebraic geometry codes
arXiv:0905.0428 [quant-ph] (Published 2009-05-04)
Generalized Concatenation for Quantum Codes
arXiv:2310.18138 [quant-ph] (Published 2023-10-27)
Optimal Single-Shot Decoding of Quantum Codes