1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2005.851760
DC FieldValue
dc.titleQuantum codes from concatenated algebraic-geometric codes
dc.contributor.authorChen, H.
dc.contributor.authorLing, S.
dc.contributor.authorXing, C.
dc.date.accessioned2014-10-28T02:44:07Z
dc.date.available2014-10-28T02:44:07Z
dc.date.issued2005-08
dc.identifier.citationChen, H., Ling, S., Xing, C. (2005-08). Quantum codes from concatenated algebraic-geometric codes. IEEE Transactions on Information Theory 51 (8) : 2915-2920. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2005.851760
dc.identifier.issn00189448
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104005
dc.description.abstractWe apply Steane's enlargement of the Calderbank-Shor-Steane (CSS) codes and additive codes over F4 to concatenated algebraic-geometric codes to construct many good quantum codes with fewer restrictions on the parameters compared to some known quantum codes. Some of the quantum codes we have constructed are either optimal or have parameters as good as the best known codes, while some have parameters better than those obtained from other known constructions. © 2005 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TIT.2005.851760
dc.sourceScopus
dc.subjectAlgebraic-geometric codes
dc.subjectConcatenated codes
dc.subjectEnlargement of the Calderbank-Shor-Steane (CSS) codes
dc.subjectQuantum error-correcting codes
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1109/TIT.2005.851760
dc.description.sourcetitleIEEE Transactions on Information Theory
dc.description.volume51
dc.description.issue8
dc.description.page2915-2920
dc.description.codenIETTA
dc.identifier.isiut000230852400016
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.