Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Annals of Mathematics

Construction of Asymptotically Good p~m-ary Quantum Codes

Hao Chen

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

This paper applies algebraic-geometric codes to construct a family of asymptot- ically good pm-ary quantum codes,for any prime power pm.

Related papers

Some Good Error-Correcting Codes from Algebraic-Geometric Codes

Hao Chen

Algebraic-geometric codes on Garcia-Stichtenoth family of curves are used to construct the asymptotically good quantum codes.

arXiv:quant-ph/0107102•Jul 20, 2001•1 citation

Asymptotically good quantum codes

Alexei Ashikhmin, Simon N. Litsyn, Michael Anatol'evich Tsfasman

Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.

arXiv:quant-ph/0006061•Physical Review A•Feb 1, 2001•90 citations

Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes

R. Matsumoto

We improve performance of the asymptotically good quantum codes constructed by Ashikhmin, Litsyn, and Tsfasman (see Phys. Rev. A, vol.63, no.3, p.032311, Mar. 2001), by using more rational points on algebraic curves.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•4 citations

Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes

Ryutaroh Matsumoto

We improve performance of the asymptotically good quantum codes constructed by Ashikhmin, Litsyn and Tsfasman (see Phys. Rev. A, vol.63, no.3, p.032311, 2001), by using more rational points on algebraic curves.

arXiv:quant-ph/0107129•IEEE Transactions on Information Theory•Jul 1, 2002•39 citations

A family of asymptotically good quantum codes based on code concatenation

Zhuo Li, Lijuan Xing, 西安电子科技大学综合业务网国家重点实验室,西安 710071

Using the idea of code concatenation in classical coding theory, we make the suggestion of constructing general concatenated quantum codes by choosing certain quantum codes as outer code and inner code. Then by concatenating quantum RS outer codes with a set of special quantum inner codes, one can construct a family of concatenated quantum codes, which is asymptotically good. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum code is constructed using bad classical codes.

Acta Physica Sinica•Jan 1, 2007•5 citations

Asymptotic bounds on quantum codes from algebraic geometry codes

Keqin Feng, San Ling, Chaoping Xing

We generalize a characterization of p-ary (p is a prime) quantum codes given by Feng and Xing to q-ary (q is a prime power) quantum codes. This characterization makes it possible to convert an asymptotic bound of Stichtenoth and Xing for nonlinear algebraic geometry codes to a quantum asymptotic bound. Besides, we also investigate the asymptotic behavior of quantum codes

IEEE Transactions on Information Theory•Mar 1, 2006•68 citations
Using the idea of code concatenation in classical coding theory, we make the suggestion of constructing general concatenated quantum codes by choosing certain quantum codes as outer code and inner code. Then by concatenating quantum RS outer codes with a set of special quantum inner codes, one can construct a family of concatenated quantum codes, which is asymptotically good. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum code is constructed using bad classical codes.