Quantum Gilbert-Varshamov Bound Through Symplectic Self-Orthogonal Codes

被引：0
|
作者：
Jin, Lingfei
Xing, Chaoping
机构：
来源：
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2011年
关键词：
Symplectic self-orthogonal; Quantum Gilbert-Varshamov bound; Symplectic distance;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give a kind of Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then obtain the Gilbert-Varshamov bound for quantum codes. The idea of obtaining the Gilbert-Varshamov bound for symplectic self-orthogonal codes follows from counting arguments.
引用
收藏
页码：455 / 458
页数：4
相关论文
共 50 条
  • [21] Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes
    Zhang C.
    Shangguan C.
    Ge G.
    IEEE Transactions on Information Theory, 2023, 69 (11) : 7099 - 7109
  • [22] Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound
    Haviv, Ishay
    Langberg, Michael
    Schwartz, Moshe
    Yaakobi, Eitan
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 586 - 588
  • [23] Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
    Gopi, Sivakanth
    Kopparty, Swastik
    Oliveira, Rafael
    Ron-Zewi, Noga
    Saraf, Shubhangi
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2073 - 2091
  • [24] ASYMPTOTICALLY GOOD FAMILIES OF GEOMETRIC GOPPA CODES AND THE GILBERT-VARSHAMOV BOUND
    VOSS, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 514 : 150 - 157
  • [25] A new subclass of alternant codes can meet the Gilbert-Varshamov bound
    Fan, Ji-Hao
    Chen, Han-Wu
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2015, 43 (11): : 2243 - 2246
  • [26] Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
    Gopi, Sivakanth
    Kopparty, Swastik
    Oliveira, Rafael
    Ron-Zewi, Noga
    Saraf, Shubhangi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (08) : 5813 - 5831
  • [27] Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound
    Jeronimo, Fernando Granha
    Quintana, Dylan
    Srivastava, Shashank
    Tulsiani, Madhur
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 434 - 445
  • [28] The Error Exponent of Random Gilbert-Varshamov Codes
    Somekh-Baruch, Anelia
    Scarlett, Jonathan
    Guillen i Fabregas, Albert
    2018 52ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2018,
  • [29] Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance
    Yekhanin, S
    Dumer, I
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) : 2357 - 2362
  • [30] Beating the Gilbert-Varshamov Bound for Online Channels
    Haviv, Ishay
    Langberg, Michael
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1392 - 1396
12345