Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

• Main Authors: Chen, Hao, Ling, San, Xing, Chaoping
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2013
• Subjects: DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
• Online Access: https://hdl.handle.net/10356/95782; http://hdl.handle.net/10220/9824
• Institution: Nanyang Technological University

It is known that quantum error correction can be achieved using classical binary codes or additive codes over F4 (see [2], [3], [9]). In [1] and [4], asymptotically good quantum codes from algebraic-geometry codes were constructed and, in [1], a bound on on (δ, R) was computed from the Tsfasman-Vladut-Zink bound of the theory of classical algebraic-geometry codes. In this correspondence, by the use of a concatenation technique we construct a family of asymptotically good quantum codes exceeding the bound in a small interval.