Binary construction of quantum codes of minimum distance three and four

被引：56
|
作者：
Li, RH [1 ]
Li, XL
机构：
[1] Air Force Engn Univ, Dept Appl Math & Phys, Coll Arts & Sci, Xian 710051, Shaanxi, Peoples R China
[2] Northwestern Polytech Univ, Dept Comp Sci & Engn, Xian 710016, Shaanxi, Peoples R China
[3] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 06期
关键词：
binary code; quantum error correcting code; self-orthogonal code;
D O I：
10.1109/TIT.2004.828149
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n greater than or equal to 12 and n = 8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.
引用
收藏
页码：1331 / 1336
页数：6
相关论文
共 50 条
12345