Please use this identifier to cite or link to this item:
|Title:||Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound||Authors:||Chen, Hao
|Keywords:||DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory||Issue Date:||2001||Source:||Chen, H., Ling, S., & Xing, C. (2001). Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. IEEE Transactions on Information Theory, 47(5), 2055-2058.||Series/Report no.:||IEEE transactions on information theory||Abstract:||It is known that quantum error correction can be achieved using classical binary codes or additive codes over F4 (see , , ). In  and , asymptotically good quantum codes from algebraic-geometry codes were constructed and, in , 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.||URI:||https://hdl.handle.net/10356/95782
|ISSN:||0018-9448||DOI:||10.1109/18.930941||Rights:||© 2001 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/18.930941].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Files in This Item:
|25. Asymptotically Good Quantum Codes Exceeding the Ashikhmin–Litsyn–Tsfasman Bound.pdf||1.03 MB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.