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 条
  • [41] Construction of protograph LDPC codes with linear minimum distance
    Divsalar, Dariush
    Dolinar, Sam
    Jones, Christopher
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 664 - +
  • [42] Quantum LDPC Codes With Almost Linear Minimum Distance
    Panteleev, Pavel
    Kalachev, Gleb
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (01) : 213 - 229
  • [43] NEW MINIMUM DISTANCE BOUNDS FOR CERTAIN BINARY LINEAR CODES
    DASKALOV, RN
    KAPRALOV, SN
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (06) : 1795 - 1796
  • [44] New Bounds on the Size of Binary Codes With Large Minimum Distance
    Pang J.C.-J.
    Mahdavifar H.
    Sandeep Pradhan S.
    IEEE Journal on Selected Areas in Information Theory, 2023, 4 : 219 - 231
  • [45] 2 NEW BINARY-CODES WITH MINIMUM DISTANCE 3
    HAMALAINEN, HO
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (04) : 875 - 875
  • [46] On the minimum average distance of binary codes: linear programming approach
    Fu, FW
    Wei, VK
    Yeung, RW
    DISCRETE APPLIED MATHEMATICS, 2001, 111 (03) : 263 - 281
  • [47] The Designed Minimum Distance of Medium Lengths for Binary Cyclic Codes
    Zheng, Junru
    Kaida, Takayasu
    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 441 - 445
  • [48] COMPUTER RESULTS ON MINIMUM DISTANCE OF SOME BINARY CYCLIC CODES
    CHEN, CL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (03) : 359 - +
  • [49] Integer and Semidefinite Programming for the Minimum Distance of Binary Linear Codes
    Dong, Hui
    Bai, Yanqin
    PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON MATRIX ANALYSIS AND APPPLICATIONS, VOL 1, 2009, : 309 - 312
  • [50] A note on binary completely regular codes with large minimum distance
    Gillespie, Neil I.
    DISCRETE MATHEMATICS, 2013, 313 (14) : 1532 - 1534
12345