Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/95782
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Hao | en |
dc.contributor.author | Ling, San | en |
dc.contributor.author | Xing, Chaoping | en |
dc.date.accessioned | 2013-04-18T03:48:48Z | en |
dc.date.accessioned | 2019-12-06T19:21:26Z | - |
dc.date.available | 2013-04-18T03:48:48Z | en |
dc.date.available | 2019-12-06T19:21:26Z | - |
dc.date.copyright | 2001 | en |
dc.date.issued | 2001 | en |
dc.identifier.citation | 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. | en |
dc.identifier.issn | 0018-9448 | en |
dc.identifier.uri | https://hdl.handle.net/10356/95782 | - |
dc.description.abstract | 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. | en |
dc.language.iso | en | en |
dc.relation.ispartofseries | IEEE transactions on information theory | en |
dc.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]. | en |
dc.subject | DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory | en |
dc.title | Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound | en |
dc.type | Journal Article | en |
dc.contributor.school | School of Physical and Mathematical Sciences | en |
dc.identifier.doi | 10.1109/18.930941 | en |
dc.description.version | Accepted version | en |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
Appears in Collections: | SPMS Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
25. Asymptotically Good Quantum Codes Exceeding the Ashikhmin–Litsyn–Tsfasman Bound.pdf | 1.03 MB | Adobe PDF | View/Open |
SCOPUSTM
Citations
10
35
Updated on Mar 12, 2024
Page view(s) 10
813
Updated on Mar 27, 2024
Download(s) 5
547
Updated on Mar 27, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.