Binary construction of quantum codes of minimum distances five and six

From MaRDI portal

DOI10.1016/J.DISC.2007.04.016MaRDI QIDQ2477383zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ruihu Li, Xueliang Li

Publication date 13 March 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.04.016


zbMATH Keywords

binary codequantum error correcting codeself-orthogonal code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum computation (81P68) Other types of codes (94B60)




Review text

The authors show the existence of a large amount of new error-correcting quantum codes of minimum distances five and six. The tool used is \textit{A. M. Steane}'s construction [IEEE Trans. Inf. Theory 45, 2492--2495 (1999; Zbl 0960.94033)] applied to some binary BCH codes. This article is a continuation of another one of the same authors in which quantum codes of distances three and four are considered [``Binary construction of quantum codes of minimum distance three and four, IEEE Trans. Inform. Theory 50, No. 6, 1331--1336 (2004)].


Recommendations


Cites work


Cited in
(10)








This page was built for publication: Binary construction of quantum codes of minimum distances five and six

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477383)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Binary_construction_of_quantum_codes_of_minimum_distances_five_and_six&oldid=74359884"
Powered by MediaWiki