• DocumentCode
    1505614
  • Title

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

  • Author

    Chen, Hao ; Ling, San ; Xing, Chaoping

  • Author_Institution
    Dept. of Math., Zhongshan Univ., Guangzhou, China
  • Volume
    47
  • Issue
    5
  • fYear
    2001
  • fDate
    7/1/2001 12:00:00 AM
  • Firstpage
    2055
  • Lastpage
    2058
  • Abstract
    It is known that quantum error correction can be achieved using classical binary codes or additive codes over F4. Asymptotically good quantum codes have been constructed from algebraic-geometry codes and a bound 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
  • Keywords
    algebraic geometric codes; binary codes; concatenated codes; error correction codes; quantum communication; Ashikhmin-Litsyn-Tsfasman bound; Tsfasman-Vladut-Zink bound; additive codes; algebraic-geometry codes; asymptotically good quantum codes; classical binary codes; concatenation technique; quantum error correction; Binary codes; Cascading style sheets; Chaos; Computer science; Concatenated codes; Equations; Error correction codes; Mathematics; Quantum computing; Quantum mechanics;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.930941
  • Filename
    930941